Recognised as Number
5,729,929
- Positive
- Odd
- Prime
- 7 digits
5,729,929 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 value5,729,929
Digit count7
Digit sum43
Digit product102,060
Multiplicative persistence2times 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 factorisation5,729,929
Distinct prime factors15,729,929
Number of divisors2
Sum of divisors σ(n)5,729,930
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,729,928integers below n that share no factor with it
Carmichael function λ(n)5,729,928the 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, 5,729,9292 in total
Arithmetic
Previous number5,729,928
Next number5,729,930
Double11,459,858
Half2,864,964.5
Square32,832,086,345,041
Cube188,125,523,678,954,432,089
Square root2,393.727010333≈irrational, shown to 9 decimal places
Cube root178.943700239≈
Negation-5,729,929
Reciprocal1.74522232 × 10^-7≈
Representations
Decimal5,729,929
Binary1010111011011101000100123 bits
Octal25667211
Hexadecimal576E89
Base 363ET8P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, seven hundred and twenty-nine thousand, nine hundred and twenty-nine
Ordinalfive million, seven hundred and twenty-nine thousand, nine hundred and twenty-ninth
Scientific notation5.729929 × 10^6
Engineering notation5.729929 × 10^6
In other bases
Ternary101210002222121base 3; the most digit-efficient integer base after e: 15 digits
Quinary2431324204base 5; one hand: 10 digits
Septenary66463222base 7: 8 digits
Nonary11702877base 9; each digit is two ternary digits: 8 digits
Duodecimal1b03b21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1fg4g9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:31:38:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TT10010000TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010001011001110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101110110111010001001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes357 6e 89
Gray code11111001101100111001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101110110111010001001
64-bit0000000000000000000000000000000000000000010101110110111010001001
One's complement11111111101010001001000101110110at 32 bits, every bit flipped
Bits reversed10010001011101101110101000000000at 32 bits
Rotated left by 100000000101011101101110100010010at 32 bits, wrapping
Shifted left by 1101011101101110100010010= 11,459,858, no wrap
Shifted right by 11010111011011101000100= 2,864,964, discarding the low bit
These bits as a double2.83096107 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,729,929 to the power 232,832,086,345,041
5,729,929 to the power 3188,125,523,678,954,432,089
5,729,929 to the power 41,077,945,893,768,227,690,105,291,681
5,729,929 to the power 56,176,553,437,133,487,120,137,323,856,420,649
First ten multiples5,729,929, 11,459,858, 17,189,787, 22,919,716, 28,649,645, 34,379,574, 40,109,503, 45,839,432, 51,569,361, 57,299,290
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1382the total stopping time
Highest value reached125,596,81621× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,729,929 → 17,189,788 → 8,594,894 → 4,297,447 → 12,892,342 → 6,446,171 → 19,338,514 → 9,669,257 → 29,007,772 → 14,503,886 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage572,992,900%
5,729,929% as a decimal57,299.29
5,729,929% of 1005,729,929
5,729,929% of 1,00057,299,290
As a fraction of 1005,729,929/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 5,729,929
Nerdulate something else
Nothing in mind? Surprise me · today’s page