Base | Representation |
---|---|
bin | 111110101011101101000110… |
… | …0001111001111101000110011 |
3 | 2200022012221002220222111111201 |
4 | 1331113122030033033220303 |
5 | 1034232023431010310110 |
6 | 5232353203012352031 |
7 | 224064524630225626 |
oct | 17527321417175063 |
9 | 2608187086874451 |
10 | 551364484463155 |
11 | 14a755401489700 |
12 | 51a0a16a315617 |
13 | 1a8865a8a34c6c |
14 | 9a2227d4c5dbd |
15 | 43b23c7755b3a |
hex | 1f5768c3cfa33 |
551364484463155 has 12 divisors (see below), whose sum is σ = 727254311738976. Its totient is φ = 400992352336400.
The previous prime is 551364484463141. The next prime is 551364484463197.
It is a happy number.
551364484463155 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 551364484463155 - 219 = 551364483938867 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 455673127051 + ... + 455673128260.
It is an arithmetic number, because the mean of its divisors is an integer number (60604525978248).
Almost surely, 2551364484463155 is an apocalyptic number.
551364484463155 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
551364484463155 is a deficient number, since it is larger than the sum of its proper divisors (175889827275821).
551364484463155 is a wasteful number, since it uses less digits than its factorization.
551364484463155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911346255338 (or 911346255327 counting only the distinct ones).
The product of its digits is 414720000, while the sum is 64.
The spelling of 551364484463155 in words is "five hundred fifty-one trillion, three hundred sixty-four billion, four hundred eighty-four million, four hundred sixty-three thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •