Base | Representation |
---|---|
bin | 1101101100010100011100… |
… | …11110011110110001101010 |
3 | 10221121111110102011012102101 |
4 | 12312022032132132301222 |
5 | 12421311001420200020 |
6 | 144012221042124014 |
7 | 6225245423322334 |
oct | 666121636366152 |
9 | 127544412135371 |
10 | 30110111100010 |
11 | 9659698824257 |
12 | 346365b35060a |
13 | 13a54a99680b6 |
14 | 7614a1210454 |
15 | 373376a1a00a |
hex | 1b628e79ec6a |
30110111100010 has 8 divisors (see below), whose sum is σ = 54198199980036. Its totient is φ = 12044044440000.
The previous prime is 30110111100007. The next prime is 30110111100059. The reversal of 30110111100010 is 1000111101103.
It can be written as a sum of positive squares in 2 ways, for example, as 25231724488161 + 4878386611849 = 5023119^2 + 2208707^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 3011011110001 = 30110111100010 / (3 + 0 + 1 + 1 + 0 + 1 + 1 + 1 + 1 + 0 + 0 + 0 + 1 + 0).
It is a self number, because there is not a number n which added to its sum of digits gives 30110111100010.
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, 1505505554991 + ... + 1505505555010.
Almost surely, 230110111100010 is an apocalyptic number.
30110111100010 is a deficient number, since it is larger than the sum of its proper divisors (24088088880026).
30110111100010 is a wasteful number, since it uses less digits than its factorization.
30110111100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3011011110008.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 30110111100010 its reverse (1000111101103), we get a palindrome (31110222201113).
The spelling of 30110111100010 in words is "thirty trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •