Base | Representation |
---|---|
bin | 1101101100111101001110… |
… | …01010000001010010010110 |
3 | 10221200120221212222200202100 |
4 | 12312132213022001102112 |
5 | 12422140314000100342 |
6 | 144030241045222530 |
7 | 6226652023040565 |
oct | 666364712012226 |
9 | 127616855880670 |
10 | 30132000003222 |
11 | 9667a0050a207 |
12 | 3467949a01a46 |
13 | 13a758778c730 |
14 | 76257a311bdc |
15 | 373c08500e4c |
hex | 1b67a7281496 |
30132000003222 has 48 divisors (see below), whose sum is σ = 70312186985040. Its totient is φ = 9270832487616.
The previous prime is 30132000003139. The next prime is 30132000003229. The reversal of 30132000003222 is 22230000023103.
It is a happy number.
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 = 30132000003195 and 30132000003204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30132000003229) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 112173 + ... + 7763799.
It is an arithmetic number, because the mean of its divisors is an integer number (1464837228855).
Almost surely, 230132000003222 is an apocalyptic number.
30132000003222 is an abundant number, since it is smaller than the sum of its proper divisors (40180186981818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30132000003222 is a wasteful number, since it uses less digits than its factorization.
30132000003222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7668477 (or 7668474 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 30132000003222 its reverse (22230000023103), we get a palindrome (52362000026325).
The spelling of 30132000003222 in words is "thirty trillion, one hundred thirty-two billion, three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •