Recognised as Number
9,012,463
- Positive
- Odd
- Prime
- 7 digits
9,012,463 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,012,463
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,012,463
Distinct prime factors19,012,463
Number of divisors2
Sum of divisors σ(n)9,012,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,012,462integers below n that share no factor with it
Carmichael function λ(n)9,012,462the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 9,012,4632 in total
Arithmetic
Previous number9,012,462
Next number9,012,464
Double18,024,926
Half4,506,231.5
Square81,224,489,326,369
Cube732,032,704,747,795,536,847
Square root3,002.076448061≈irrational, shown to 9 decimal places
Cube root208.104353148≈
Negation-9,012,463
Reciprocal1.1095746 × 10^-7≈
Representations
Decimal9,012,463
Binary10001001100001001110111124 bits
Octal42302357
Hexadecimal8984EF
Base 365D627
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, twelve thousand, four hundred and sixty-three
Ordinalnine million, twelve thousand, four hundred and sixty-third
Scientific notation9.012463 × 10^6
Engineering notation9.012463 × 10^6
In other bases
Ternary121221212202221base 3; the most digit-efficient integer base after e: 15 digits
Quinary4301344323base 5; one hand: 10 digits
Septenary136414255base 7: 9 digits
Nonary17855687base 9; each digit is two ternary digits: 8 digits
Duodecimal3027667base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g6b33base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:43:27:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00T0T0T100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101000010100110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010011000010011101111
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 set bits, so even; 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
Bytes389 84 ef
Gray code110011010100011010011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010011000010011101111
64-bit0000000000000000000000000000000000000000100010011000010011101111
One's complement11111111011101100111101100010000at 32 bits, every bit flipped
Bits reversed11110111001000011001000100000000at 32 bits
Rotated left by 100000001000100110000100111011110at 32 bits, wrapping
Shifted left by 11000100110000100111011110= 18,024,926, no wrap
Shifted right by 110001001100001001110111= 4,506,231, discarding the low bit
These bits as a double4.45274835 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,012,463 to the power 281,224,489,326,369
9,012,463 to the power 3732,032,704,747,795,536,847
9,012,463 to the power 46,597,417,666,329,431,607,398,724,161
9,012,463 to the power 559,458,982,613,340,348,172,711,527,748,218,543
First ten multiples9,012,463, 18,024,926, 27,037,389, 36,049,852, 45,062,315, 54,074,778, 63,087,241, 72,099,704, 81,112,167, 90,124,630
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1362the total stopping time
Highest value reached2,886,757,684320× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,012,463 → 27,037,390 → 13,518,695 → 40,556,086 → 20,278,043 → 60,834,130 → 30,417,065 → 91,251,196 → 45,625,598 → 22,812,799 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage901,246,300%
9,012,463% as a decimal90,124.63
9,012,463% of 1009,012,463
9,012,463% of 1,00090,124,630
As a fraction of 1009,012,463/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 9,012,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page