Recognised as Number

9,012,462

Positive
Even
Composite
7 digits

9,012,462 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,012,462

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 433 × 3,469

Distinct prime factors42, 3, 433, 3,469

Number of divisors16

Sum of divisors σ(n)18,071,760

Aliquot sum9,059,298sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)2,996,352integers below n that share no factor with it

Carmichael function λ(n)124,848the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,996,352

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 433, 866, 1,299, 2,598, 3,469, 6,938, 10,407, 20,814, 1,502,077, 3,004,154, 4,506,231, 9,012,46216 in total

Arithmetic

Previous number9,012,461

Next number9,012,463

Double18,024,924

Half4,506,231

Square81,224,471,301,444

Cube732,032,461,074,354,595,128

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

Cube root208.104345451≈

Negation-9,012,462

Reciprocal1.10957472 × 10^-7≈

Representations

Decimal9,012,462

Binary10001001100001001110111024 bits

Octal42302356

Hexadecimal8984EE

Base 365D626

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

In wordsnine million, twelve thousand, four hundred and sixty-two

Ordinalnine million, twelve thousand, four hundred and sixty-second

Scientific notation9.012462 × 10^6

Engineering notation9.012462 × 10^6

In other bases

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

Quinary4301344322base 5; one hand: 10 digits

Septenary136414254base 7: 9 digits

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

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

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

Sexagesimal41:43:27:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100010011000010011101110

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 even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes389 84 ee

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

At each machine width

32-bit00000000100010011000010011101110

64-bit0000000000000000000000000000000000000000100010011000010011101110

One's complement11111111011101100111101100010001at 32 bits, every bit flipped

Bits reversed01110111001000011001000100000000at 32 bits

Rotated left by 100000001000100110000100111011100at 32 bits, wrapping

Shifted left by 11000100110000100111011100= 18,024,924, no wrap

Shifted right by 110001001100001001110111= 4,506,231, discarding the low bit

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

Nearest landmarks

Next prime9,012,463+1

Previous prime9,012,449−13

Distance to nearest prime1

Nearest square below9,012,004

Nearest square above9,018,009

Powers & multiples

9,012,462 to the power 281,224,471,301,444

9,012,462 to the power 3732,032,461,074,354,595,128

9,012,462 to the power 46,597,414,738,199,099,963,116,485,136

9,012,462 to the power 559,458,949,626,259,336,851,788,723,861,764,832

First ten multiples9,012,462, 18,024,924, 27,037,386, 36,049,848, 45,062,310, 54,074,772, 63,087,234, 72,099,696, 81,112,158, 90,124,620

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12No, remainder 6

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached30,417,0643× the starting value

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

First steps9,012,462 → 4,506,231 → 13,518,694 → 6,759,347 → 20,278,042 → 10,139,021 → 30,417,064 → 15,208,532 → 7,604,266 → 3,802,133 → …

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

As a percentage & fraction

As a percentage901,246,200%

9,012,462% as a decimal90,124.62

9,012,462% of 1009,012,462

9,012,462% of 1,00090,124,620

As a fraction of 1009,012,462/100

Read another way

As seconds104 days, 7 hours and 27 minutes

As bytes8.595 MiB

As a 24-bit colour#8984EE

Keep nerding

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