Recognised as Number

9,113,357

Positive
Odd
Composite
7 digits

9,113,357 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,113,357

Digit count7

Digit sum29

Digit product2,835

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11^3 × 41 × 167

Distinct prime factors311, 41, 167

Number of divisors16

Sum of divisors σ(n)10,329,984

Aliquot sum1,216,627sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)8,034,400integers below n that share no factor with it

Carmichael function λ(n)401,720the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,034,400

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 11, 41, 121, 167, 451, 1,331, 1,837, 4,961, 6,847, 20,207, 54,571, 75,317, 222,277, 828,487, 9,113,35716 in total

Arithmetic

Previous number9,113,356

Next number9,113,358

Double18,226,714

Half4,556,678.5

Square83,053,275,809,449

Cube756,894,152,470,972,710,293

Square root3,018.833715195≈irrational, shown to 9 decimal places

Cube root208.878045195≈

Negation-9,113,357

Reciprocal1.09729049 × 10^-7≈

Representations

Decimal9,113,357

Binary10001011000011110000110124 bits

Octal42607415

Hexadecimal8B0F0D

Base 365FBWT

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, one hundred and thirteen thousand, three hundred and fifty-seven

Ordinalnine million, one hundred and thirteen thousand, three hundred and fifty-seventh

Scientific notation9.113357 × 10^6

Engineering notation9.113357 × 10^6

In other bases

Ternary122011000011202base 3; the most digit-efficient integer base after e: 15 digits

Quinary4313111412base 5; one hand: 10 digits

Septenary140314361base 7: 9 digits

Nonary18130152base 9; each digit is two ternary digits: 8 digits

Duodecimal3075b25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal2gj37hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal42:11:29:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T0T0110001TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1100111110001001100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100010110000111100001101

Bit length24 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits13within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes38b 0f 0d

Gray code110011101000100010001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100010110000111100001101

64-bit0000000000000000000000000000000000000000100010110000111100001101

One's complement11111111011101001111000011110010at 32 bits, every bit flipped

Bits reversed10110000111100001101000100000000at 32 bits

Rotated left by 100000001000101100001111000011010at 32 bits, wrapping

Shifted left by 11000101100001111000011010= 18,226,714, no wrap

Shifted right by 110001011000011110000110= 4,556,678, discarding the low bit

These bits as a double4.50259661 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,113,383+26

Previous prime9,113,323−34

Distance to nearest prime26

Nearest square below9,108,324

Nearest square above9,114,361

Powers & multiples

9,113,357 to the power 283,053,275,809,449

9,113,357 to the power 3756,894,152,470,972,710,293

9,113,357 to the power 46,897,846,622,680,406,446,157,683,601

9,113,357 to the power 562,862,538,803,730,840,848,936,248,948,958,557

First ten multiples9,113,357, 18,226,714, 27,340,071, 36,453,428, 45,566,785, 54,680,142, 63,793,499, 72,906,856, 82,020,213, 91,133,570

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1225the total stopping time

Highest value reached27,340,0723× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,113,357 → 27,340,072 → 13,670,036 → 6,835,018 → 3,417,509 → 10,252,528 → 5,126,264 → 2,563,132 → 1,281,566 → 640,783 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage911,335,700%

9,113,357% as a decimal91,133.57

9,113,357% of 1009,113,357

9,113,357% of 1,00091,133,570

As a fraction of 1009,113,357/100

Read another way

As seconds105 days, 11 hours and 29 minutes

As bytes8.691 MiB

As a 24-bit colour#8B0F0D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.