Base | Representation |
---|---|
bin | 1011000110110010011000… |
… | …0110101001101010000110 |
3 | 1121020101022201000221210110 |
4 | 2301230212012221222012 |
5 | 3100032100203101410 |
6 | 41545432345533450 |
7 | 2400142460312034 |
oct | 261544606515206 |
9 | 47211281027713 |
10 | 12211231300230 |
11 | 39888327a5106 |
12 | 14527507a4286 |
13 | 6a768b82c431 |
14 | 30305357d554 |
15 | 1629973c2720 |
hex | b1b261a9a86 |
12211231300230 has 64 divisors (see below), whose sum is σ = 30924779374080. Its totient is φ = 3079751659776.
The previous prime is 12211231300181. The next prime is 12211231300243. The reversal of 12211231300230 is 3200313211221.
It is a super-2 number, since 2×122112313002302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12211231300197 and 12211231300206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99362392 + ... + 99485211.
It is an arithmetic number, because the mean of its divisors is an integer number (483199677720).
Almost surely, 212211231300230 is an apocalyptic number.
12211231300230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12211231300230 is an abundant number, since it is smaller than the sum of its proper divisors (18713548073850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12211231300230 is a wasteful number, since it uses less digits than its factorization.
12211231300230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198847725.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12211231300230 its reverse (3200313211221), we get a palindrome (15411544511451).
The spelling of 12211231300230 in words is "twelve trillion, two hundred eleven billion, two hundred thirty-one million, three hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •