Base | Representation |
---|---|
bin | 1110001001110000001010… |
… | …11100000000100010011011 |
3 | 11002012011211120021110012122 |
4 | 13010320011130000202123 |
5 | 13034343134102131011 |
6 | 150104552424531455 |
7 | 6361306622314040 |
oct | 704700534004233 |
9 | 132164746243178 |
10 | 31121424255131 |
11 | 9a09581727021 |
12 | 35a765a020b8b |
13 | 14499789b3a62 |
14 | 7983dbd631c7 |
15 | 38e81657c3db |
hex | 1c4e0570089b |
31121424255131 has 64 divisors (see below), whose sum is σ = 38750936733696. Its totient is φ = 24413274547200.
The previous prime is 31121424255067. The next prime is 31121424255149. The reversal of 31121424255131 is 13155242412113.
It is not a de Polignac number, because 31121424255131 - 26 = 31121424255067 is a prime.
It is a super-2 number, since 2×311214242551312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31121424255091 and 31121424255100.
It is not an unprimeable number, because it can be changed into a prime (31121424255151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2137012856 + ... + 2137027418.
It is an arithmetic number, because the mean of its divisors is an integer number (605483386464).
Almost surely, 231121424255131 is an apocalyptic number.
31121424255131 is a deficient number, since it is larger than the sum of its proper divisors (7629512478565).
31121424255131 is a wasteful number, since it uses less digits than its factorization.
31121424255131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20572.
The product of its digits is 28800, while the sum is 35.
Adding to 31121424255131 its reverse (13155242412113), we get a palindrome (44276666667244).
The spelling of 31121424255131 in words is "thirty-one trillion, one hundred twenty-one billion, four hundred twenty-four million, two hundred fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •