Base | Representation |
---|---|
bin | 11101110101001101110100… |
… | …101001011100010110101100 |
3 | 122012112121222002112002221010 |
4 | 131311031310221130112230 |
5 | 114144041230142341022 |
6 | 1143012332445505220 |
7 | 36430624212026502 |
oct | 3565156451342654 |
9 | 565477862462833 |
10 | 131200323012012 |
11 | 38893820a55aa1 |
12 | 1286b602872210 |
13 | 58291a2a67057 |
14 | 24581b556a672 |
15 | 1027c4c7db50c |
hex | 775374a5c5ac |
131200323012012 has 24 divisors (see below), whose sum is σ = 307672449280000. Its totient is φ = 43513674968016.
The previous prime is 131200323011911. The next prime is 131200323012019. The reversal of 131200323012012 is 210210323002131.
It is a self number, because there is not a number n which added to its sum of digits gives 131200323012012.
It is not an unprimeable number, because it can be changed into a prime (131200323012019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27470752012 + ... + 27470756787.
Almost surely, 2131200323012012 is an apocalyptic number.
131200323012012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131200323012012 is an abundant number, since it is smaller than the sum of its proper divisors (176472126267988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131200323012012 is a wasteful number, since it uses less digits than its factorization.
131200323012012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54941509005 (or 54941509003 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131200323012012 its reverse (210210323002131), we get a palindrome (341410646014143).
The spelling of 131200323012012 in words is "one hundred thirty-one trillion, two hundred billion, three hundred twenty-three million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •