Recognised as Number
5,140,991
- Positive
- Odd
- Prime
- 7 digits
5,140,991 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,140,991
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,140,991
Distinct prime factors15,140,991
Number of divisors2
Sum of divisors σ(n)5,140,992
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,140,990integers below n that share no factor with it
Carmichael function λ(n)5,140,990the 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,140,9912 in total
Arithmetic
Previous number5,140,990
Next number5,140,992
Double10,281,982
Half2,570,495.5
Square26,429,788,462,081
Cube135,875,304,615,462,262,271
Square root2,267.375354898≈irrational, shown to 9 decimal places
Cube root172.589994349≈
Negation-5,140,991
Reciprocal1.94515026 × 10^-7≈
Representations
Decimal5,140,991
Binary1001110011100011111111123 bits
Octal23470777
Hexadecimal4E71FF
Base 36326TB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and forty thousand, nine hundred and ninety-one
Ordinalfive million, one hundred and forty thousand, nine hundred and ninety-first
Scientific notation5.140991 × 10^6
Engineering notation5.140991 × 10^6
In other bases
Ternary100200012010002base 3; the most digit-efficient integer base after e: 15 digits
Quinary2304002431base 5; one hand: 10 digits
Septenary61461212base 7: 8 digits
Nonary10605102base 9; each digit is two ternary digits: 8 digits
Duodecimal187b13bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c2c9bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:48:3:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T001TT01001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111011011000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011100111000111111111
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
Bytes34e 71 ff
Gray code11010010100100100000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011100111000111111111
64-bit0000000000000000000000000000000000000000010011100111000111111111
One's complement11111111101100011000111000000000at 32 bits, every bit flipped
Bits reversed11111111100011100111001000000000at 32 bits
Rotated left by 100000000100111001110001111111110at 32 bits, wrapping
Shifted left by 1100111001110001111111110= 10,281,982, no wrap
Shifted right by 11001110011100011111111= 2,570,495, discarding the low bit
These bits as a double2.53998704 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,140,991 to the power 226,429,788,462,081
5,140,991 to the power 3135,875,304,615,462,262,271
5,140,991 to the power 4698,533,718,150,349,951,174,850,561
5,140,991 to the power 53,591,155,558,207,485,745,840,346,160,445,951
First ten multiples5,140,991, 10,281,982, 15,422,973, 20,563,964, 25,704,955, 30,845,946, 35,986,937, 41,127,928, 46,268,919, 51,409,910
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1126the total stopping time
Highest value reached395,274,00476× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,140,991 → 15,422,974 → 7,711,487 → 23,134,462 → 11,567,231 → 34,701,694 → 17,350,847 → 52,052,542 → 26,026,271 → 78,078,814 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage514,099,100%
5,140,991% as a decimal51,409.91
5,140,991% of 1005,140,991
5,140,991% of 1,00051,409,910
As a fraction of 1005,140,991/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,140,991
Nerdulate something else
Nothing in mind? Surprise me · today’s page