Recognised as Number
5,553,389
- Positive
- Odd
- Prime
- 7 digits
5,553,389 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,553,389
Digit count7
Digit sum38
Digit product81,000
Multiplicative persistence2times 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,553,389
Distinct prime factors15,553,389
Number of divisors2
Sum of divisors σ(n)5,553,390
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,553,388integers below n that share no factor with it
Carmichael function λ(n)5,553,388the 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,553,3892 in total
Arithmetic
Previous number5,553,388
Next number5,553,390
Double11,106,778
Half2,776,694.5
Square30,840,129,385,321
Cube171,267,235,287,018,402,869
Square root2,356.562963301≈irrational, shown to 9 decimal places
Cube root177.086735449≈
Negation-5,553,389
Reciprocal1.80070224 × 10^-7≈
Representations
Decimal5,553,389
Binary1010100101111001110110123 bits
Octal25136355
Hexadecimal54BCED
Base 363B10T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and fifty-three thousand, three hundred and eighty-nine
Ordinalfive million, five hundred and fifty-three thousand, three hundred and eighty-ninth
Scientific notation5.553389 × 10^6
Engineering notation5.553389 × 10^6
In other bases
Ternary101110010211002base 3; the most digit-efficient integer base after e: 15 digits
Quinary2410202024base 5; one hand: 10 digits
Septenary65126432base 7: 8 digits
Nonary11403732base 9; each digit is two ternary digits: 8 digits
Duodecimal1a39925base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ee399base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:42:36:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101110011T1101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101011100110100111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101001011110011101101
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
Bytes354 bc ed
Gray code11111101110001010011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101001011110011101101
64-bit0000000000000000000000000000000000000000010101001011110011101101
One's complement11111111101010110100001100010010at 32 bits, every bit flipped
Bits reversed10110111001111010010101000000000at 32 bits
Rotated left by 100000000101010010111100111011010at 32 bits, wrapping
Shifted left by 1101010010111100111011010= 11,106,778, no wrap
Shifted right by 11010100101111001110110= 2,776,694, discarding the low bit
These bits as a double2.74373872 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,553,389 to the power 230,840,129,385,321
5,553,389 to the power 3171,267,235,287,018,402,869
5,553,389 to the power 4951,113,580,503,339,841,290,273,041
5,553,389 to the power 55,281,903,695,717,861,937,883,148,112,885,949
First ten multiples5,553,389, 11,106,778, 16,660,167, 22,213,556, 27,766,945, 33,320,334, 38,873,723, 44,427,112, 49,980,501, 55,533,890
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1201the total stopping time
Highest value reached16,660,1683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,553,389 → 16,660,168 → 8,330,084 → 4,165,042 → 2,082,521 → 6,247,564 → 3,123,782 → 1,561,891 → 4,685,674 → 2,342,837 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage555,338,900%
5,553,389% as a decimal55,533.89
5,553,389% of 1005,553,389
5,553,389% of 1,00055,533,890
As a fraction of 1005,553,389/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,553,389
Nerdulate something else
Nothing in mind? Surprise me · today’s page