Recognised as Number
5,399,441
- Positive
- Odd
- Prime
- 7 digits
5,399,441 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,399,441
Digit count7
Digit sum35
Digit product19,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,399,441
Distinct prime factors15,399,441
Number of divisors2
Sum of divisors σ(n)5,399,442
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,399,440integers below n that share no factor with it
Carmichael function λ(n)5,399,440the 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,399,4412 in total
Arithmetic
Previous number5,399,440
Next number5,399,442
Double10,798,882
Half2,699,720.5
Square29,153,963,112,481
Cube157,415,103,742,017,523,121
Square root2,323.669726962≈irrational, shown to 9 decimal places
Cube root175.435010284≈
Negation-5,399,441
Reciprocal1.85204357 × 10^-7≈
Representations
Decimal5,399,441
Binary1010010011000111001000123 bits
Octal24461621
Hexadecimal526391
Base 3637Q8H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and ninety-nine thousand, four hundred and forty-one
Ordinalfive million, three hundred and ninety-nine thousand, four hundred and forty-first
Scientific notation5.399441 × 10^6
Engineering notation5.399441 × 10^6
In other bases
Ternary101011022122022base 3; the most digit-efficient integer base after e: 15 digits
Quinary2340240231base 5; one hand: 10 digits
Septenary63615545base 7: 8 digits
Nonary11138568base 9; each digit is two ternary digits: 8 digits
Duodecimal1984815base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1deic1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:59:50:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101011100T0T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111010010010010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100110001110010001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 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 63 91
Gray code11110110101001001011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100110001110010001
64-bit0000000000000000000000000000000000000000010100100110001110010001
One's complement11111111101011011001110001101110at 32 bits, every bit flipped
Bits reversed10001001110001100100101000000000at 32 bits
Rotated left by 100000000101001001100011100100010at 32 bits, wrapping
Shifted left by 1101001001100011100100010= 10,798,882, no wrap
Shifted right by 11010010011000111001000= 2,699,720, discarding the low bit
These bits as a double2.6676783 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,399,441 to the power 229,153,963,112,481
5,399,441 to the power 3157,415,103,742,017,523,121
5,399,441 to the power 4849,953,565,163,902,837,057,975,361
5,399,441 to the power 54,589,274,127,842,148,698,427,151,541,173,201
First ten multiples5,399,441, 10,798,882, 16,198,323, 21,597,764, 26,997,205, 32,396,646, 37,796,087, 43,195,528, 48,594,969, 53,994,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1201the total stopping time
Highest value reached16,198,3243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,399,441 → 16,198,324 → 8,099,162 → 4,049,581 → 12,148,744 → 6,074,372 → 3,037,186 → 1,518,593 → 4,555,780 → 2,277,890 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage539,944,100%
5,399,441% as a decimal53,994.41
5,399,441% of 1005,399,441
5,399,441% of 1,00053,994,410
As a fraction of 1005,399,441/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,399,441
Nerdulate something else
Nothing in mind? Surprise me · today’s page