Base | Representation |
---|---|
bin | 1101101001001101001011… |
… | …11011001001110110000110 |
3 | 10221020021022201220222120100 |
4 | 12310212211323021312012 |
5 | 12413032402324410042 |
6 | 143451125304344530 |
7 | 6214440352523412 |
oct | 664464573116606 |
9 | 127207281828510 |
10 | 30003130310022 |
11 | 961828a975331 |
12 | 3446983775146 |
13 | 139838ab1a3bc |
14 | 75a232dd3d42 |
15 | 3706b4a0d24c |
hex | 1b49a5ec9d86 |
30003130310022 has 24 divisors (see below), whose sum is σ = 65055992671800. Its totient is φ = 9993472616160.
The previous prime is 30003130310003. The next prime is 30003130310047. The reversal of 30003130310022 is 22001303130003.
30003130310022 is a `hidden beast` number, since 300 + 0 + 3 + 1 + 30 + 310 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 30003130309977 and 30003130310004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 630877272 + ... + 630924827.
It is an arithmetic number, because the mean of its divisors is an integer number (2710666361325).
Almost surely, 230003130310022 is an apocalyptic number.
30003130310022 is an abundant number, since it is smaller than the sum of its proper divisors (35052862361778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30003130310022 is a wasteful number, since it uses less digits than its factorization.
30003130310022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1261803428 (or 1261803425 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 30003130310022 its reverse (22001303130003), we get a palindrome (52004433440025).
The spelling of 30003130310022 in words is "thirty trillion, three billion, one hundred thirty million, three hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •