Recognised as Number
9,010,396
- Positive
- Even
- Composite
- 7 digits
9,010,396 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,010,396
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 127 × 17,737
Distinct prime factors32, 127, 17,737
Number of divisors12
Sum of divisors σ(n)15,893,248
Aliquot sum6,882,852sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,469,472integers below n that share no factor with it
Carmichael function λ(n)372,456the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,469,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 127, 254, 508, 17,737, 35,474, 70,948, 2,252,599, 4,505,198, 9,010,39612 in total
Arithmetic
Previous number9,010,395
Next number9,010,397
Double18,020,792
Half4,505,198
Square81,187,236,076,816
Cube731,529,147,197,598,579,136
Square root3,001.7321666≈irrational, shown to 9 decimal places
Cube root208.088442418≈
Negation-9,010,396
Reciprocal1.10982914 × 10^-7≈
Representations
Decimal9,010,396
Binary10001001011111001101110024 bits
Octal42276334
Hexadecimal897CDC
Base 365D4GS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, ten thousand, three hundred and ninety-six
Ordinalnine million, ten thousand, three hundred and ninety-sixth
Scientific notation9.010396 × 10^6
Engineering notation9.010396 × 10^6
In other bases
Ternary121221202221101base 3; the most digit-efficient integer base after e: 15 digits
Quinary4301313041base 5; one hand: 10 digits
Septenary136405243base 7: 9 digits
Nonary17852841base 9; each digit is two ternary digits: 8 digits
Duodecimal3026424base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g65jgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:42:53:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00TT100T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101000110100101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010111110011011100
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes389 7c dc
Gray code110011011100001010110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010111110011011100
64-bit0000000000000000000000000000000000000000100010010111110011011100
One's complement11111111011101101000001100100011at 32 bits, every bit flipped
Bits reversed00111011001111101001000100000000at 32 bits
Rotated left by 100000001000100101111100110111000at 32 bits, wrapping
Shifted left by 11000100101111100110111000= 18,020,792, no wrap
Shifted right by 110001001011111001101110= 4,505,198, discarding the low bit
These bits as a double4.45172712 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,010,396 to the power 281,187,236,076,816
9,010,396 to the power 3731,529,147,197,598,579,136
9,010,396 to the power 46,591,367,301,792,653,447,052,697,856
9,010,396 to the power 559,390,829,570,603,317,448,709,840,550,910,976
First ten multiples9,010,396, 18,020,792, 27,031,188, 36,041,584, 45,051,980, 54,062,376, 63,072,772, 72,083,168, 81,093,564, 90,103,960
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 96
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached15,205,0481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,010,396 → 4,505,198 → 2,252,599 → 6,757,798 → 3,378,899 → 10,136,698 → 5,068,349 → 15,205,048 → 7,602,524 → 3,801,262 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage901,039,600%
9,010,396% as a decimal90,103.96
9,010,396% of 1009,010,396
9,010,396% of 1,00090,103,960
As a fraction of 1009,010,396/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,010,396
Nerdulate something else
Nothing in mind? Surprise me · today’s page