Recognised as Number
9,940,129
- Positive
- Odd
- Prime
- 7 digits
9,940,129 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,940,129
Digit count7
Digit sum34
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,940,129
Distinct prime factors19,940,129
Number of divisors2
Sum of divisors σ(n)9,940,130
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,940,128integers below n that share no factor with it
Carmichael function λ(n)9,940,128the 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,940,1292 in total
Arithmetic
Previous number9,940,128
Next number9,940,130
Double19,880,258
Half4,970,064.5
Square98,806,164,536,641
Cube982,146,021,489,436,766,689
Square root3,152.797012178≈irrational, shown to 9 decimal places
Cube root215.012647534≈
Negation-9,940,129
Reciprocal1.00602316 × 10^-7≈
Representations
Decimal9,940,129
Binary10010111101011001010000124 bits
Octal45726241
Hexadecimal97ACA1
Base 365X1UP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and forty thousand, one hundred and twenty-nine
Ordinalnine million, nine hundred and forty thousand, one hundred and twenty-ninth
Scientific notation9.940129 × 10^6
Engineering notation9.940129 × 10^6
In other bases
Ternary200201000021221base 3; the most digit-efficient integer base after e: 15 digits
Quinary10021041004base 5; one hand: 11 digits
Septenary150326653base 7: 9 digits
Nonary20630257base 9; each digit is two ternary digits: 8 digits
Duodecimal33b4481base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal322a69base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:1:8:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0100010T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010001111110111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101111010110010100001
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
Bytes397 ac a1
Gray code110111000111101011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101111010110010100001
64-bit0000000000000000000000000000000000000000100101111010110010100001
One's complement11111111011010000101001101011110at 32 bits, every bit flipped
Bits reversed10000101001101011110100100000000at 32 bits
Rotated left by 100000001001011110101100101000010at 32 bits, wrapping
Shifted left by 11001011110101100101000010= 19,880,258, no wrap
Shifted right by 110010111101011001010000= 4,970,064, discarding the low bit
These bits as a double4.91107625 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,940,129 to the power 298,806,164,536,641
9,940,129 to the power 3982,146,021,489,436,766,689
9,940,129 to the power 49,762,658,150,441,773,598,231,562,881
9,940,129 to the power 597,042,081,398,292,636,555,215,906,908,751,649
First ten multiples9,940,129, 19,880,258, 29,820,387, 39,760,516, 49,700,645, 59,640,774, 69,580,903, 79,521,032, 89,461,161, 99,401,290
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1189the total stopping time
Highest value reached143,299,52814× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,940,129 → 29,820,388 → 14,910,194 → 7,455,097 → 22,365,292 → 11,182,646 → 5,591,323 → 16,773,970 → 8,386,985 → 25,160,956 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage994,012,900%
9,940,129% as a decimal99,401.29
9,940,129% of 1009,940,129
9,940,129% of 1,00099,401,290
As a fraction of 1009,940,129/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,940,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page