Base | Representation |
---|---|
bin | 11001000010001111110101… |
… | …01111001010111101100111 |
3 | 21012220222220110111102212220 |
4 | 30201013322233022331213 |
5 | 24203441114420040003 |
6 | 313030524110443423 |
7 | 14411301524146251 |
oct | 1441077257127547 |
9 | 235828813442786 |
10 | 55052802502503 |
11 | 165a5842875273 |
12 | 6211728203573 |
13 | 24945c304c260 |
14 | d847d9996cd1 |
15 | 6570b2ca7353 |
hex | 3211fabcaf67 |
55052802502503 has 8 divisors (see below), whose sum is σ = 79050177952368. Its totient is φ = 33878647693824.
The previous prime is 55052802502499. The next prime is 55052802502507. The reversal of 55052802502503 is 30520520825055.
It is an interprime number because it is at equal distance from previous prime (55052802502499) and next prime (55052802502507).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55052802502503 - 22 = 55052802502499 is a prime.
It is a super-2 number, since 2×550528025025032 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55052802502507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 705805160250 + ... + 705805160327.
It is an arithmetic number, because the mean of its divisors is an integer number (9881272244046).
Almost surely, 255052802502503 is an apocalyptic number.
55052802502503 is a deficient number, since it is larger than the sum of its proper divisors (23997375449865).
55052802502503 is a wasteful number, since it uses less digits than its factorization.
55052802502503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411610320593.
The product of its (nonzero) digits is 600000, while the sum is 42.
The spelling of 55052802502503 in words is "fifty-five trillion, fifty-two billion, eight hundred two million, five hundred two thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •