Recognised as Number
5,020,007
- Positive
- Odd
- Prime
- 7 digits
5,020,007 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,020,007
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,020,007
Distinct prime factors15,020,007
Number of divisors2
Sum of divisors σ(n)5,020,008
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,020,006integers below n that share no factor with it
Carmichael function λ(n)5,020,006the 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,020,0072 in total
Arithmetic
Previous number5,020,006
Next number5,020,008
Double10,040,014
Half2,510,003.5
Square25,200,470,280,049
Cube126,506,537,209,137,940,343
Square root2,240.537212367≈irrational, shown to 9 decimal places
Cube root171.225367725≈
Negation-5,020,007
Reciprocal1.99202909 × 10^-7≈
Representations
Decimal5,020,007
Binary1001100100110010110011123 bits
Octal23114547
Hexadecimal4C9967
Base 362ZLGN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, twenty thousand and seven
Ordinalfive million, twenty thousand and seventh
Scientific notation5.020007 × 10^6
Engineering notation5.020007 × 10^6
In other bases
Ternary100110001011012base 3; the most digit-efficient integer base after e: 15 digits
Quinary2241120012base 5; one hand: 10 digits
Septenary60445406base 7: 8 digits
Nonary10401135base 9; each digit is two ternary digits: 8 digits
Duodecimal182111bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b7a07base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:14:26:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001100010111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111011110111010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011001001100101100111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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 99 67
Gray code11010101101010111010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011001001100101100111
64-bit0000000000000000000000000000000000000000010011001001100101100111
One's complement11111111101100110110011010011000at 32 bits, every bit flipped
Bits reversed11100110100110010011001000000000at 32 bits
Rotated left by 100000000100110010011001011001110at 32 bits, wrapping
Shifted left by 1100110010011001011001110= 10,040,014, no wrap
Shifted right by 11001100100110010110011= 2,510,003, discarding the low bit
These bits as a double2.480213 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,020,007 to the power 225,200,470,280,049
5,020,007 to the power 3126,506,537,209,137,940,343
5,020,007 to the power 4635,063,702,335,632,924,487,442,401
5,020,007 to the power 53,188,024,231,170,793,630,357,432,265,116,807
First ten multiples5,020,007, 10,040,014, 15,060,021, 20,080,028, 25,100,035, 30,120,042, 35,140,049, 40,160,056, 45,180,063, 50,200,070
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1281the total stopping time
Highest value reached128,657,32025× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,020,007 → 15,060,022 → 7,530,011 → 22,590,034 → 11,295,017 → 33,885,052 → 16,942,526 → 8,471,263 → 25,413,790 → 12,706,895 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage502,000,700%
5,020,007% as a decimal50,200.07
5,020,007% of 1005,020,007
5,020,007% of 1,00050,200,070
As a fraction of 1005,020,007/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,020,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page