Base | Representation |
---|---|
bin | 1101101100101000111110… |
… | …10001000001000010010000 |
3 | 10221122112220100112112121110 |
4 | 12312110133101001002100 |
5 | 12422001033312414412 |
6 | 144021242311453320 |
7 | 6226115454202020 |
oct | 666243721010220 |
9 | 127575810475543 |
10 | 30121130201232 |
11 | 9663332819084 |
12 | 3465815687240 |
13 | 13a654481ca35 |
14 | 761c28853a80 |
15 | 3737be0cdd3c |
hex | 1b651f441090 |
30121130201232 has 160 divisors (see below), whose sum is σ = 91438220079360. Its totient is φ = 8366193838080.
The previous prime is 30121130201189. The next prime is 30121130201233. The reversal of 30121130201232 is 23210203112103.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 30121130201199 and 30121130201208.
It is not an unprimeable number, because it can be changed into a prime (30121130201233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5817819 + ... + 9699962.
It is an arithmetic number, because the mean of its divisors is an integer number (571488875496).
Almost surely, 230121130201232 is an apocalyptic number.
It is an amenable number.
30121130201232 is an abundant number, since it is smaller than the sum of its proper divisors (61317089878128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30121130201232 is a wasteful number, since it uses less digits than its factorization.
30121130201232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15517961 (or 15517955 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30121130201232 its reverse (23210203112103), we get a palindrome (53331333313335).
The spelling of 30121130201232 in words is "thirty trillion, one hundred twenty-one billion, one hundred thirty million, two hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •