Recognised as Number
5,403,901
- Positive
- Odd
- Prime
- 7 digits
5,403,901 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,403,901
Digit count7
Digit sum22
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,403,901
Distinct prime factors15,403,901
Number of divisors2
Sum of divisors σ(n)5,403,902
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,403,900integers below n that share no factor with it
Carmichael function λ(n)5,403,900the 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,403,9012 in total
Arithmetic
Previous number5,403,900
Next number5,403,902
Double10,807,802
Half2,701,950.5
Square29,202,146,017,801
Cube157,805,506,067,740,841,701
Square root2,324.629217746≈irrational, shown to 9 decimal places
Cube root175.483300765≈
Negation-5,403,901
Reciprocal1.85051503 × 10^-7≈
Representations
Decimal5,403,901
Binary1010010011101001111110123 bits
Octal24472375
Hexadecimal5274FD
Base 3637TOD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and three thousand, nine hundred and one
Ordinalfive million, four hundred and three thousand, nine hundred and first
Scientific notation5.403901 × 10^6
Engineering notation5.403901 × 10^6
In other bases
Ternary101011112202111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2340411101base 5; one hand: 10 digits
Septenary63634546base 7: 8 digits
Nonary11145674base 9; each digit is two ternary digits: 8 digits
Duodecimal1987311base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1df9f1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:1:5:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1011TTTT0T1T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111011010100001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100111010011111101
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes352 74 fd
Gray code11110110100111010000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100111010011111101
64-bit0000000000000000000000000000000000000000010100100111010011111101
One's complement11111111101011011000101100000010at 32 bits, every bit flipped
Bits reversed10111111001011100100101000000000at 32 bits
Rotated left by 100000000101001001110100111111010at 32 bits, wrapping
Shifted left by 1101001001110100111111010= 10,807,802, no wrap
Shifted right by 11010010011101001111110= 2,701,950, discarding the low bit
These bits as a double2.66988184 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,403,901 to the power 229,202,146,017,801
5,403,901 to the power 3157,805,506,067,740,841,701
5,403,901 to the power 4852,765,332,044,970,802,208,875,601
5,403,901 to the power 54,608,259,430,603,149,763,027,345,069,119,501
First ten multiples5,403,901, 10,807,802, 16,211,703, 21,615,604, 27,019,505, 32,423,406, 37,827,307, 43,231,208, 48,635,109, 54,039,010
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1144the total stopping time
Highest value reached30,776,9205× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,403,901 → 16,211,704 → 8,105,852 → 4,052,926 → 2,026,463 → 6,079,390 → 3,039,695 → 9,119,086 → 4,559,543 → 13,678,630 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage540,390,100%
5,403,901% as a decimal54,039.01
5,403,901% of 1005,403,901
5,403,901% of 1,00054,039,010
As a fraction of 1005,403,901/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,403,901
Nerdulate something else
Nothing in mind? Surprise me · today’s page