Recognised as Number
5,140,989
- Positive
- Odd
- Composite
- 7 digits
5,140,989 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,140,989
Digit count7
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 7 × 9,067
Distinct prime factors33, 7, 9,067
Number of divisors20
Sum of divisors σ(n)8,777,824
Aliquot sum3,636,835sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,937,384integers below n that share no factor with it
Carmichael function λ(n)81,594the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,937,384
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 63, 81, 189, 567, 9,067, 27,201, 63,469, 81,603, 190,407, 244,809, 571,221, 734,427, 1,713,663, 5,140,98920 in total
Arithmetic
Previous number5,140,988
Next number5,140,990
Double10,281,978
Half2,570,494.5
Square26,429,767,898,121
Cube135,875,146,036,793,181,669
Square root2,267.37491386≈irrational, shown to 9 decimal places
Cube root172.589971968≈
Negation-5,140,989
Reciprocal1.94515102 × 10^-7≈
Representations
Decimal5,140,989
Binary1001110011100011111110123 bits
Octal23470775
Hexadecimal4E71FD
Base 36326T9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and forty thousand, nine hundred and eighty-nine
Ordinalfive million, one hundred and forty thousand, nine hundred and eighty-ninth
Scientific notation5.140989 × 10^6
Engineering notation5.140989 × 10^6
In other bases
Ternary100200012010000base 3; the most digit-efficient integer base after e: 15 digits
Quinary2304002424base 5; one hand: 10 digits
Septenary61461210base 7: 8 digits
Nonary10605100base 9; each digit is two ternary digits: 8 digits
Duodecimal187b139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c2c99base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:48:3:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T001TT010000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111011011000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011100111000111111101
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes34e 71 fd
Gray code11010010100100100000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011100111000111111101
64-bit0000000000000000000000000000000000000000010011100111000111111101
One's complement11111111101100011000111000000010at 32 bits, every bit flipped
Bits reversed10111111100011100111001000000000at 32 bits
Rotated left by 100000000100111001110001111111010at 32 bits, wrapping
Shifted left by 1100111001110001111111010= 10,281,978, no wrap
Shifted right by 11001110011100011111110= 2,570,494, discarding the low bit
These bits as a double2.53998605 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,140,989 to the power 226,429,767,898,121
5,140,989 to the power 3135,875,146,036,793,181,669
5,140,989 to the power 4698,532,631,148,547,342,235,330,641
5,140,989 to the power 53,591,148,572,875,739,252,411,070,236,743,949
First ten multiples5,140,989, 10,281,978, 15,422,967, 20,563,956, 25,704,945, 30,845,934, 35,986,923, 41,127,912, 46,268,901, 51,409,890
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1250the total stopping time
Highest value reached44,518,5528× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,140,989 → 15,422,968 → 7,711,484 → 3,855,742 → 1,927,871 → 5,783,614 → 2,891,807 → 8,675,422 → 4,337,711 → 13,013,134 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage514,098,900%
5,140,989% as a decimal51,409.89
5,140,989% of 1005,140,989
5,140,989% of 1,00051,409,890
As a fraction of 1005,140,989/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,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page