Base | Representation |
---|---|
bin | 11001000011111010011001… |
… | …00100011101011011100010 |
3 | 21020010110120100111110220001 |
4 | 30201331030210131123202 |
5 | 24210410300030013442 |
6 | 313113104502010214 |
7 | 14415365264646436 |
oct | 1441751444353342 |
9 | 236113510443801 |
10 | 55110010001122 |
11 | 16618029a2674a |
12 | 6220832a1696a |
13 | 2499b0c0a635b |
14 | d874a56189c6 |
15 | 6588102a22b7 |
hex | 321f4c91d6e2 |
55110010001122 has 16 divisors (see below), whose sum is σ = 82749485693952. Its totient is φ = 27526848814080.
The previous prime is 55110010001107. The next prime is 55110010001141. The reversal of 55110010001122 is 22110001001155.
55110010001122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×551100100011222 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55110010001122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232106338 + ... + 232343650.
It is an arithmetic number, because the mean of its divisors is an integer number (5171842855872).
Almost surely, 255110010001122 is an apocalyptic number.
55110010001122 is a deficient number, since it is larger than the sum of its proper divisors (27639475692830).
55110010001122 is a wasteful number, since it uses less digits than its factorization.
55110010001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355473.
The product of its (nonzero) digits is 100, while the sum is 19.
Adding to 55110010001122 its reverse (22110001001155), we get a palindrome (77220011002277).
The spelling of 55110010001122 in words is "fifty-five trillion, one hundred ten billion, ten million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •