Base | Representation |
---|---|
bin | 1011000001100110000101… |
… | …0111010100001011011110 |
3 | 1120220212002012022221021110 |
4 | 2300121201113110023132 |
5 | 3042101404442224410 |
6 | 41440441222242450 |
7 | 2360534143131363 |
oct | 260314127241336 |
9 | 46825065287243 |
10 | 12122031211230 |
11 | 3953a19663a96 |
12 | 14393b7886426 |
13 | 69c14465b695 |
14 | 2dc9d09c646a |
15 | 1604c63a1720 |
hex | b06615d42de |
12122031211230 has 128 divisors (see below), whose sum is σ = 29738681376768. Its totient is φ = 3161586379392.
The previous prime is 12122031211193. The next prime is 12122031211321. The reversal of 12122031211230 is 3211213022121.
It is a super-2 number, since 2×121220312112302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12122031211197 and 12122031211206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1155905047 + ... + 1155915533.
It is an arithmetic number, because the mean of its divisors is an integer number (232333448256).
Almost surely, 212122031211230 is an apocalyptic number.
12122031211230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12122031211230 is an abundant number, since it is smaller than the sum of its proper divisors (17616650165538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12122031211230 is a wasteful number, since it uses less digits than its factorization.
12122031211230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15190.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12122031211230 its reverse (3211213022121), we get a palindrome (15333244233351).
The spelling of 12122031211230 in words is "twelve trillion, one hundred twenty-two billion, thirty-one million, two hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •