Recognised as Number
5,510,959
- Positive
- Odd
- Prime
- 7 digits
5,510,959 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,510,959
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,510,959
Distinct prime factors15,510,959
Number of divisors2
Sum of divisors σ(n)5,510,960
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,510,958integers below n that share no factor with it
Carmichael function λ(n)5,510,958the 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,510,9592 in total
Arithmetic
Previous number5,510,958
Next number5,510,960
Double11,021,918
Half2,755,479.5
Square30,370,669,099,681
Cube167,371,512,210,908,904,079
Square root2,347.543183841≈irrational, shown to 9 decimal places
Cube root176.634578643≈
Negation-5,510,959
Reciprocal1.81456621 × 10^-7≈
Representations
Decimal5,510,959
Binary1010100000101110010111123 bits
Octal25013457
Hexadecimal54172F
Base 363A4A7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and ten thousand, nine hundred and fifty-nine
Ordinalfive million, five hundred and ten thousand, nine hundred and fifty-ninth
Scientific notation5.510959 × 10^6
Engineering notation5.510959 × 10^6
In other bases
Ternary101100222121121base 3; the most digit-efficient integer base after e: 15 digits
Quinary2402322314base 5; one hand: 10 digits
Septenary64561636base 7: 8 digits
Nonary11328547base 9; each digit is two ternary digits: 8 digits
Duodecimal1a19267base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1e8h7jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:30:49:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101101000T0TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101000110101101110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101000001011100101111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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 17 2f
Gray code11111100001110010111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101000001011100101111
64-bit0000000000000000000000000000000000000000010101000001011100101111
One's complement11111111101010111110100011010000at 32 bits, every bit flipped
Bits reversed11110100111010000010101000000000at 32 bits
Rotated left by 100000000101010000010111001011110at 32 bits, wrapping
Shifted left by 1101010000010111001011110= 11,021,918, no wrap
Shifted right by 11010100000101110010111= 2,755,479, discarding the low bit
These bits as a double2.72277552 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,510,959 to the power 230,370,669,099,681
5,510,959 to the power 3167,371,512,210,908,904,079
5,510,959 to the power 4922,377,541,562,318,323,114,301,761
5,510,959 to the power 55,083,184,814,070,732,223,631,669,318,498,799
First ten multiples5,510,959, 11,021,918, 16,532,877, 22,043,836, 27,554,795, 33,065,754, 38,576,713, 44,087,672, 49,598,631, 55,109,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached55,798,46810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,510,959 → 16,532,878 → 8,266,439 → 24,799,318 → 12,399,659 → 37,198,978 → 18,599,489 → 55,798,468 → 27,899,234 → 13,949,617 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage551,095,900%
5,510,959% as a decimal55,109.59
5,510,959% of 1005,510,959
5,510,959% of 1,00055,109,590
As a fraction of 1005,510,959/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,959
Nerdulate something else
Nothing in mind? Surprise me · today’s page