Base | Representation |
---|---|
bin | 11001000001100110011000… |
… | …11001100101010111001101 |
3 | 21012211212110122222010221221 |
4 | 30200303030121211113031 |
5 | 24203110031331130203 |
6 | 313012404043523341 |
7 | 14406553223155252 |
oct | 1440631431452715 |
9 | 235755418863857 |
10 | 55030550255053 |
11 | 16597363a8041a |
12 | 6209357b29551 |
13 | 2492487b7b929 |
14 | d836c8513429 |
15 | 65670e44dabd |
hex | 320ccc6655cd |
55030550255053 has 4 divisors (see below), whose sum is σ = 55030609872160. Its totient is φ = 55030490637948.
The previous prime is 55030550255029. The next prime is 55030550255071. The reversal of 55030550255053 is 35055205503055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55030550255053 is a prime.
It is a super-2 number, since 2×550305502550532 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55030550258053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28401825 + ... + 30277462.
It is an arithmetic number, because the mean of its divisors is an integer number (13757652468040).
Almost surely, 255030550255053 is an apocalyptic number.
It is an amenable number.
55030550255053 is a deficient number, since it is larger than the sum of its proper divisors (59617107).
55030550255053 is an equidigital number, since it uses as much as digits as its factorization.
55030550255053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59617106.
The product of its (nonzero) digits is 1406250, while the sum is 43.
The spelling of 55030550255053 in words is "fifty-five trillion, thirty billion, five hundred fifty million, two hundred fifty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •