Base | Representation |
---|---|
bin | 10110100110001001… |
… | …11011101000101100 |
3 | 1011022110000211100220 |
4 | 23103010323220230 |
5 | 144321043020022 |
6 | 5323434051340 |
7 | 606423445242 |
oct | 132304735054 |
9 | 34273024326 |
10 | 12131220012 |
11 | 516583716a |
12 | 2426879b50 |
13 | 11b43b96c2 |
14 | 831218792 |
15 | 4b004085c |
hex | 2d313ba2c |
12131220012 has 48 divisors (see below), whose sum is σ = 28506992640. Its totient is φ = 4015107072.
The previous prime is 12131219993. The next prime is 12131220037. The reversal of 12131220012 is 21002213121.
12131220012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12131219973 and 12131220000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2175564 + ... + 2181132.
It is an arithmetic number, because the mean of its divisors is an integer number (593895680).
Almost surely, 212131220012 is an apocalyptic number.
12131220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12131220012 is an abundant number, since it is smaller than the sum of its proper divisors (16375772628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12131220012 is a wasteful number, since it uses less digits than its factorization.
12131220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6830 (or 6828 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 12131220012 its reverse (21002213121), we get a palindrome (33133433133).
The spelling of 12131220012 in words is "twelve billion, one hundred thirty-one million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •