Base | Representation |
---|---|
bin | 100011011111001000100010… |
… | …0111100110111010110010011 |
3 | 1111221012111120121102122221110 |
4 | 1012332101010330313112103 |
5 | 311403114211200311011 |
6 | 3023512051434024403 |
7 | 122514346462602441 |
oct | 10676210474672623 |
9 | 1457174517378843 |
10 | 312142200010131 |
11 | 90504844414657 |
12 | 2b0132bb278103 |
13 | 10522b633bc81a |
14 | 5711a97cc3b91 |
15 | 26148056c0ba6 |
hex | 11be444f37593 |
312142200010131 has 16 divisors (see below), whose sum is σ = 426634391449728. Its totient is φ = 202879400136000.
The previous prime is 312142200010111. The next prime is 312142200010237. The reversal of 312142200010131 is 131010002241213.
It is not a de Polignac number, because 312142200010131 - 219 = 312142199485843 is a prime.
It is a super-2 number, since 2×3121422000101312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312142200010098 and 312142200010107.
It is not an unprimeable number, because it can be changed into a prime (312142200010111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 874301701 + ... + 874658646.
It is an arithmetic number, because the mean of its divisors is an integer number (26664649465608).
Almost surely, 2312142200010131 is an apocalyptic number.
312142200010131 is a deficient number, since it is larger than the sum of its proper divisors (114492191439597).
312142200010131 is a wasteful number, since it uses less digits than its factorization.
312142200010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1748961842.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 312142200010131 its reverse (131010002241213), we get a palindrome (443152202251344).
The spelling of 312142200010131 in words is "three hundred twelve trillion, one hundred forty-two billion, two hundred million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •