Base | Representation |
---|---|
bin | 1101111001010001001000… |
… | …00100101011100011101001 |
3 | 11000012000210122220112112211 |
4 | 12330220210010223203221 |
5 | 13001103121123104010 |
6 | 144552435134005121 |
7 | 6302345306260636 |
oct | 674504404534351 |
9 | 130160718815484 |
10 | 30555002550505 |
11 | 9810338410864 |
12 | 35159206467a1 |
13 | 140842a86c4a4 |
14 | 778c2746718d |
15 | 37ec1455e08a |
hex | 1bca2412b8e9 |
30555002550505 has 8 divisors (see below), whose sum is σ = 37357814439432. Its totient is φ = 23982794454528.
The previous prime is 30555002550473. The next prime is 30555002550521. The reversal of 30555002550505 is 50505520055503.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4772533959769 + 25782468590736 = 2184613^2 + 5077644^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30555002550505 - 25 = 30555002550473 is a prime.
It is a super-2 number, since 2×305550025505052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57650947944 + ... + 57650948473.
It is an arithmetic number, because the mean of its divisors is an integer number (4669726804929).
Almost surely, 230555002550505 is an apocalyptic number.
It is an amenable number.
30555002550505 is a deficient number, since it is larger than the sum of its proper divisors (6802811888927).
30555002550505 is a wasteful number, since it uses less digits than its factorization.
30555002550505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115301896475.
The product of its (nonzero) digits is 468750, while the sum is 40.
The spelling of 30555002550505 in words is "thirty trillion, five hundred fifty-five billion, two million, five hundred fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •