Recognised as Number
5,510,477
- Positive
- Odd
- Composite
- 7 digits
5,510,477 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,510,477
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 factorisation7 × 443 × 1,777
Distinct prime factors37, 443, 1,777
Number of divisors8
Sum of divisors σ(n)6,315,456
Aliquot sum804,979sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,709,952integers below n that share no factor with it
Carmichael function λ(n)392,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,709,952
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 443, 1,777, 3,101, 12,439, 787,211, 5,510,4778 in total
Arithmetic
Previous number5,510,476
Next number5,510,478
Double11,020,954
Half2,755,238.5
Square30,365,356,767,529
Cube167,327,600,064,262,901,333
Square root2,347.440521078≈irrational, shown to 9 decimal places
Cube root176.629428883≈
Negation-5,510,477
Reciprocal1.81472493 × 10^-7≈
Representations
Decimal5,510,477
Binary1010100000101010100110123 bits
Octal25012515
Hexadecimal54154D
Base 363A3WT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and ten thousand, four hundred and seventy-seven
Ordinalfive million, five hundred and ten thousand, four hundred and seventy-seventh
Scientific notation5.510477 × 10^6
Engineering notation5.510477 × 10^6
In other bases
Ternary101100221221202base 3; the most digit-efficient integer base after e: 15 digits
Quinary2402313402base 5; one hand: 10 digits
Septenary64560350base 7: 8 digits
Nonary11327852base 9; each digit is two ternary digits: 8 digits
Duodecimal1a18b25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1e8g3hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:30:41:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10110100T00TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101000001010101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101000001010101001101
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
Bytes354 15 4d
Gray code11111100001111111101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101000001010101001101
64-bit0000000000000000000000000000000000000000010101000001010101001101
One's complement11111111101010111110101010110010at 32 bits, every bit flipped
Bits reversed10110010101010000010101000000000at 32 bits
Rotated left by 100000000101010000010101010011010at 32 bits, wrapping
Shifted left by 1101010000010101010011010= 11,020,954, no wrap
Shifted right by 11010100000101010100110= 2,755,238, discarding the low bit
These bits as a double2.72253738 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,510,477 to the power 230,365,356,767,529
5,510,477 to the power 3167,327,600,064,262,901,333
5,510,477 to the power 4922,054,891,619,319,239,748,765,841
5,510,477 to the power 55,080,962,273,005,751,426,293,059,945,216,157
First ten multiples5,510,477, 11,020,954, 16,531,431, 22,041,908, 27,552,385, 33,062,862, 38,573,339, 44,083,816, 49,594,293, 55,104,770
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 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1201the total stopping time
Highest value reached39,720,2927× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,510,477 → 16,531,432 → 8,265,716 → 4,132,858 → 2,066,429 → 6,199,288 → 3,099,644 → 1,549,822 → 774,911 → 2,324,734 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage551,047,700%
5,510,477% as a decimal55,104.77
5,510,477% of 1005,510,477
5,510,477% of 1,00055,104,770
As a fraction of 1005,510,477/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,510,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page