Base | Representation |
---|---|
bin | 1101101111100011100110… |
… | …01010110010100101000111 |
3 | 10222000010111220021111202011 |
4 | 12313301303022302211013 |
5 | 12430121231424244421 |
6 | 144135252251555051 |
7 | 6236263351256146 |
oct | 667616312624507 |
9 | 128003456244664 |
10 | 30221322103111 |
11 | 96a1877505977 |
12 | 348111775ba87 |
13 | 13b2b2100c789 |
14 | 766a1118975d |
15 | 3761d50c34e1 |
hex | 1b7c732b2947 |
30221322103111 has 8 divisors (see below), whose sum is σ = 30798349765920. Its totient is φ = 29644546812192.
The previous prime is 30221322103103. The next prime is 30221322103127. The reversal of 30221322103111 is 11130122312203.
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 30221322103111 - 23 = 30221322103103 is a prime.
It is a super-2 number, since 2×302213221031112 (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 (30221322103151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62851180 + ... + 63330193.
It is an arithmetic number, because the mean of its divisors is an integer number (3849793720740).
Almost surely, 230221322103111 is an apocalyptic number.
30221322103111 is a deficient number, since it is larger than the sum of its proper divisors (577027662809).
30221322103111 is a wasteful number, since it uses less digits than its factorization.
30221322103111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126185945.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 30221322103111 its reverse (11130122312203), we get a palindrome (41351444415314).
The spelling of 30221322103111 in words is "thirty trillion, two hundred twenty-one billion, three hundred twenty-two million, one hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •