Recognised as Number
5,035,999
- Positive
- Odd
- Prime
- 7 digits
5,035,999 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 value5,035,999
Digit count7
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,035,999
Distinct prime factors15,035,999
Number of divisors2
Sum of divisors σ(n)5,036,000
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,035,998integers below n that share no factor with it
Carmichael function λ(n)5,035,998the 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,035,9992 in total
Arithmetic
Previous number5,035,998
Next number5,036,000
Double10,071,998
Half2,517,999.5
Square25,361,285,928,001
Cube127,719,410,572,127,107,999
Square root2,244.103161622≈irrational, shown to 9 decimal places
Cube root171.406996524≈
Negation-5,035,999
Reciprocal1.98570333 × 10^-7≈
Representations
Decimal5,035,999
Binary1001100110101111101111123 bits
Octal23153737
Hexadecimal4CD7DF
Base 362ZXSV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, thirty-five thousand, nine hundred and ninety-nine
Ordinalfive million, thirty-five thousand, nine hundred and ninety-ninth
Scientific notation5.035999 × 10^6
Engineering notation5.035999 × 10^6
In other bases
Ternary100110212002111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2242122444base 5; one hand: 10 digits
Septenary60543133base 7: 8 digits
Nonary10425074base 9; each digit is two ternary digits: 8 digits
Duodecimal182a427base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b99jjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:18:53:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001110TT01T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111010010100000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011001101011111011111
Bit length23 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits7within that length
Bit parityeven16 set bits, so even; 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
Bytes34c d7 df
Gray code11010101011110000110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011001101011111011111
64-bit0000000000000000000000000000000000000000010011001101011111011111
One's complement11111111101100110010100000100000at 32 bits, every bit flipped
Bits reversed11111011111010110011001000000000at 32 bits
Rotated left by 100000000100110011010111110111110at 32 bits, wrapping
Shifted left by 1100110011010111110111110= 10,071,998, no wrap
Shifted right by 11001100110101111101111= 2,517,999, discarding the low bit
These bits as a double2.4881141 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,035,999 to the power 225,361,285,928,001
5,035,999 to the power 3127,719,410,572,127,107,999
5,035,999 to the power 4643,194,823,921,821,543,755,856,001
5,035,999 to the power 53,239,128,490,075,469,372,532,947,065,179,999
First ten multiples5,035,999, 10,071,998, 15,107,997, 20,143,996, 25,179,995, 30,215,994, 35,251,993, 40,287,992, 45,323,991, 50,359,990
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1144the total stopping time
Highest value reached76,484,24815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,035,999 → 15,107,998 → 7,553,999 → 22,661,998 → 11,330,999 → 33,992,998 → 16,996,499 → 50,989,498 → 25,494,749 → 76,484,248 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage503,599,900%
5,035,999% as a decimal50,359.99
5,035,999% of 1005,035,999
5,035,999% of 1,00050,359,990
As a fraction of 1005,035,999/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,035,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page