Recognised as Number
9,953,721
- Positive
- Odd
- Composite
- 7 digits
9,953,721 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,953,721
Digit count7
Digit sum36
Digit product17,010
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 17 × 67 × 971
Distinct prime factors43, 17, 67, 971
Number of divisors24
Sum of divisors σ(n)15,466,464
Aliquot sum5,512,743sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,145,920integers below n that share no factor with it
Carmichael function λ(n)256,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,145,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 51, 67, 153, 201, 603, 971, 1,139, 2,913, 3,417, 8,739, 10,251, 16,507, 49,521, 65,057, 148,563, 195,171, 585,513, 1,105,969, 3,317,907, 9,953,72124 in total
Arithmetic
Previous number9,953,720
Next number9,953,722
Double19,907,442
Half4,976,860.5
Square99,076,561,745,841
Cube986,180,453,257,374,224,361
Square root3,154.951822136≈irrational, shown to 9 decimal places
Cube root215.11060471≈
Negation-9,953,721
Reciprocal1.00464942 × 10^-7≈
Representations
Decimal9,953,721
Binary10010111111000011011100124 bits
Octal45760671
Hexadecimal97E1B9
Base 365XCC9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and fifty-three thousand, seven hundred and twenty-one
Ordinalnine million, nine hundred and fifty-three thousand, seven hundred and twenty-first
Scientific notation9.953721 × 10^6
Engineering notation9.953721 × 10^6
In other bases
Ternary200201200221100base 3; the most digit-efficient integer base after e: 15 digits
Quinary10022004341base 5; one hand: 11 digits
Septenary150414411base 7: 9 digits
Nonary20650840base 9; each digit is two ternary digits: 8 digits
Duodecimal3400309base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal324461base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:4:55:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1TT010T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010000010011011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101111110000110111001
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 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
Bytes397 e1 b9
Gray code110111000001000101100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101111110000110111001
64-bit0000000000000000000000000000000000000000100101111110000110111001
One's complement11111111011010000001111001000110at 32 bits, every bit flipped
Bits reversed10011101100001111110100100000000at 32 bits
Rotated left by 100000001001011111100001101110010at 32 bits, wrapping
Shifted left by 11001011111100001101110010= 19,907,442, no wrap
Shifted right by 110010111111000011011100= 4,976,860, discarding the low bit
These bits as a double4.91779159 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,953,721 to the power 299,076,561,745,841
9,953,721 to the power 3986,180,453,257,374,224,361
9,953,721 to the power 49,816,165,087,377,444,221,880,797,281
9,953,721 to the power 597,707,368,569,695,701,477,663,551,392,632,601
First ten multiples9,953,721, 19,907,442, 29,861,163, 39,814,884, 49,768,605, 59,722,326, 69,676,047, 79,629,768, 89,583,489, 99,537,210
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1238the total stopping time
Highest value reached33,593,8123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,953,721 → 29,861,164 → 14,930,582 → 7,465,291 → 22,395,874 → 11,197,937 → 33,593,812 → 16,796,906 → 8,398,453 → 25,195,360 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage995,372,100%
9,953,721% as a decimal99,537.21
9,953,721% of 1009,953,721
9,953,721% of 1,00099,537,210
As a fraction of 1009,953,721/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,953,721
Nerdulate something else
Nothing in mind? Surprise me · today’s page