Base | Representation |
---|---|
bin | 11001010000101110001000… |
… | …10101101001111000111111 |
3 | 21021200112112101212011211022 |
4 | 30220113010111221320333 |
5 | 24240113104122100421 |
6 | 314051211051414355 |
7 | 14462235261436451 |
oct | 1450270425517077 |
9 | 237615471764738 |
10 | 55550106050111 |
11 | 1677773874a112 |
12 | 6291b961543bb |
13 | 24cc47765626a |
14 | da08d4a2c2d1 |
15 | 664ebbd067ab |
hex | 3285c4569e3f |
55550106050111 has 4 divisors (see below), whose sum is σ = 55552944458424. Its totient is φ = 55547267641800.
The previous prime is 55550106050107. The next prime is 55550106050137. The reversal of 55550106050111 is 11105060105555.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 55550106050111 - 22 = 55550106050107 is a prime.
It is a super-2 number, since 2×555501060501112 (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 (55550106050311) 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, 1419174800 + ... + 1419213941.
It is an arithmetic number, because the mean of its divisors is an integer number (13888236114606).
Almost surely, 255550106050111 is an apocalyptic number.
55550106050111 is a deficient number, since it is larger than the sum of its proper divisors (2838408313).
55550106050111 is a wasteful number, since it uses less digits than its factorization.
55550106050111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2838408312.
The product of its (nonzero) digits is 18750, while the sum is 35.
Adding to 55550106050111 its reverse (11105060105555), we get a palindrome (66655166155666).
The spelling of 55550106050111 in words is "fifty-five trillion, five hundred fifty billion, one hundred six million, fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •