Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …11001011010000011110111 |
3 | 21012221200111211120001112201 |
4 | 30201032220121122003313 |
5 | 24204100400304000210 |
6 | 313034115253525331 |
7 | 14411645254314145 |
oct | 1441165031320367 |
9 | 235850454501481 |
10 | 55060011000055 |
11 | 165a8901886166 |
12 | 6212bba343847 |
13 | 24951a15c6219 |
14 | d84cc10a8595 |
15 | 657385a5853a |
hex | 3213a865a0f7 |
55060011000055 has 4 divisors (see below), whose sum is σ = 66072013200072. Its totient is φ = 44048008800040.
The previous prime is 55060011000047. The next prime is 55060011000077. The reversal of 55060011000055 is 55000011006055.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 55060011000055 - 23 = 55060011000047 is a prime.
It is a super-2 number, since 2×550600110000552 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55060010999987 and 55060011000032.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5506001100001 + ... + 5506001100010.
It is an arithmetic number, because the mean of its divisors is an integer number (16518003300018).
Almost surely, 255060011000055 is an apocalyptic number.
55060011000055 is a deficient number, since it is larger than the sum of its proper divisors (11012002200017).
55060011000055 is a wasteful number, since it uses less digits than its factorization.
55060011000055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11012002200016.
The product of its (nonzero) digits is 3750, while the sum is 28.
It can be divided in two parts, 5506001 and 1000055, that added together give a palindrome (6506056).
The spelling of 55060011000055 in words is "fifty-five trillion, sixty billion, eleven million, fifty-five", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.015 sec. • engine limits •