Nerdulator> put something in

Recognised as Number

9,912,829

  • Positive
  • Odd
  • Prime
  • 7 digits

9,912,829 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,912,829
Digit count7
Digit sum40
Digit product23,328
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,912,829
Distinct prime factors19,912,829
Number of divisors2
Sum of divisors σ(n)9,912,830
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,912,828integers below n that share no factor with it
Carmichael function λ(n)9,912,828the 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,912,8292 in total

Arithmetic

Previous number9,912,828
Next number9,912,830
Cube974,076,001,103,696,098,789
Square root3,148.46454641≈irrational, shown to 9 decimal places
Cube root214.815627045≈
Negation-9,912,829
Reciprocal1.00879376 × 10^-7≈

Representations

Decimal9,912,829
Binary10010111010000011111110124 bits
Octal45640775
Hexadecimal9741FD
Base 365WGSD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and twelve thousand, eight hundred and twenty-nine
Ordinalnine million, nine hundred and twelve thousand, eight hundred and twenty-ninth
Scientific notation9.912829 × 10^6
Engineering notation9.912829 × 10^6

In other bases

Ternary200122121211211base 3; the most digit-efficient integer base after e: 15 digits
Quinary10014202304base 5; one hand: 11 digits
Septenary150154243base 7: 9 digits
Nonary20577754base 9; each digit is two ternary digits: 8 digits
Duodecimal33a0711base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal31j219base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:53:33:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T00T0T0TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010110100011000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101110100000111111101
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 41 fd
Gray code110111001110000100000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101110100000111111101
64-bit0000000000000000000000000000000000000000100101110100000111111101
One's complement11111111011010001011111000000010at 32 bits, every bit flipped
Bits reversed10111111100000101110100100000000at 32 bits
Rotated left by 100000001001011101000001111111010at 32 bits, wrapping
Shifted left by 11001011101000001111111010= 19,825,658, no wrap
Shifted right by 110010111010000011111110= 4,956,414, discarding the low bit
These bits as a double4.89758826 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,912,869+40
Previous prime9,912,803−26
Distance to nearest prime0, it is prime
Nearest square below9,909,904
Nearest square above9,916,201

Powers & multiples

9,912,829 to the power 298,264,178,783,241
9,912,829 to the power 3974,076,001,103,696,098,789
9,912,829 to the power 49,655,848,831,944,750,695,262,464,081
9,912,829 to the power 595,716,778,320,918,051,089,767,916,553,595,149
First ten multiples9,912,829, 19,825,658, 29,738,487, 39,651,316, 49,564,145, 59,476,974, 69,389,803, 79,302,632, 89,215,461, 99,128,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 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time
Highest value reached84,685,0128× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,912,829 → 29,738,488 → 14,869,244 → 7,434,622 → 3,717,311 → 11,151,934 → 5,575,967 → 16,727,902 → 8,363,951 → 25,091,854 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage991,282,900%
9,912,829% as a decimal99,128.29
9,912,829% of 1009,912,829
9,912,829% of 1,00099,128,290
As a fraction of 1009,912,829/100

Read another way

As bytes9.454 MiB
As a 24-bit colour#9741FD

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “9912829” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.