Recognised as Number

5,505,151

Positive
Odd
Prime
7 digits

5,505,151 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,505,151

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,505,151

Distinct prime factors15,505,151

Number of divisors2

Sum of divisors σ(n)5,505,152

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)5,505,150integers below n that share no factor with it

Carmichael function λ(n)5,505,150the 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,505,1512 in total

Arithmetic

Previous number5,505,150

Next number5,505,152

Double11,010,302

Half2,752,575.5

Square30,306,687,532,801

Cube166,842,891,177,886,957,951

Square root2,346.305819794≈irrational, shown to 9 decimal places

Cube root176.5725051≈

Negation-5,505,151

Reciprocal1.8164806 × 10^-7≈

Representations

Decimal5,505,151

Binary1010100000000000111111123 bits

Octal25000177

Hexadecimal54007F

Base 3639ZSV

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfive million, five hundred and five thousand, one hundred and fifty-one

Ordinalfive million, five hundred and five thousand, one hundred and fifty-first

Scientific notation5.505151 × 10^6

Engineering notation5.505151 × 10^6

In other bases

Ternary101100200122111base 3; the most digit-efficient integer base after e: 15 digits

Quinary2402131101base 5; one hand: 10 digits

Septenary64536001base 7: 8 digits

Nonary11320574base 9; each digit is two ternary digits: 8 digits

Duodecimal1a15a27base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal1e82hbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal25:29:12:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary101101T01T0T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10101000000000110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101000000000001111111

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 00 7f

Gray code11111100000000001000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101000000000001111111

64-bit0000000000000000000000000000000000000000010101000000000001111111

One's complement11111111101010111111111110000000at 32 bits, every bit flipped

Bits reversed11111110000000000010101000000000at 32 bits

Rotated left by 100000000101010000000000011111110at 32 bits, wrapping

Shifted left by 1101010000000000011111110= 11,010,302, no wrap

Shifted right by 11010100000000000111111= 2,752,575, discarding the low bit

These bits as a double2.71990598 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,505,167+16

Previous prime5,505,139−12

Distance to nearest prime0, it is prime

Nearest square below5,503,716

Nearest square above5,508,409

Powers & multiples

5,505,151 to the power 230,306,687,532,801

5,505,151 to the power 3166,842,891,177,886,957,951

5,505,151 to the power 4918,495,309,210,835,564,450,905,601

5,505,151 to the power 55,056,455,369,997,340,618,472,467,420,250,751

First ten multiples5,505,151, 11,010,302, 16,515,453, 22,020,604, 27,525,755, 33,030,906, 38,536,057, 44,041,208, 49,546,359, 55,051,510

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1201the total stopping time

Highest value reached188,121,36434× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps5,505,151 → 16,515,454 → 8,257,727 → 24,773,182 → 12,386,591 → 37,159,774 → 18,579,887 → 55,739,662 → 27,869,831 → 83,609,494 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage550,515,100%

5,505,151% as a decimal55,051.51

5,505,151% of 1005,505,151

5,505,151% of 1,00055,051,510

As a fraction of 1005,505,151/100

Read another way

As seconds63 days, 17 hours and 12 minutes

As bytes5.25 MiB

As a 24-bit colour#54007F

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.