Base | Representation |
---|---|
bin | 1101111001001001111000… |
… | …01000001101101100010001 |
3 | 11000011122202110120112221101 |
4 | 12330210330020031230101 |
5 | 13001022133424201031 |
6 | 144550553044024401 |
7 | 6302150005105546 |
oct | 674447410155421 |
9 | 130148673515841 |
10 | 30551111162641 |
11 | 9809720870533 |
12 | 3515015392101 |
13 | 1407c5a5b8514 |
14 | 778978706bcd |
15 | 37ea87ae0361 |
hex | 1bc93c20db11 |
30551111162641 has 4 divisors (see below), whose sum is σ = 30600466754800. Its totient is φ = 30501755570484.
The previous prime is 30551111162617. The next prime is 30551111162659. The reversal of 30551111162641 is 14626111115503.
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 not a de Polignac number, because 30551111162641 - 229 = 30550574291729 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30551111162641.
It is not an unprimeable number, because it can be changed into a prime (30551111162681) 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, 24677795151 + ... + 24677796388.
It is an arithmetic number, because the mean of its divisors is an integer number (7650116688700).
Almost surely, 230551111162641 is an apocalyptic number.
It is an amenable number.
30551111162641 is a deficient number, since it is larger than the sum of its proper divisors (49355592159).
30551111162641 is an equidigital number, since it uses as much as digits as its factorization.
30551111162641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49355592158.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 30551111162641 in words is "thirty trillion, five hundred fifty-one billion, one hundred eleven million, one hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •