Base | Representation |
---|---|
bin | 1110000111001000001011… |
… | …00011111001011100011101 |
3 | 11001212120000220122200100202 |
4 | 13003210011203321130131 |
5 | 13031403430343310023 |
6 | 145555315020033245 |
7 | 6351634600012064 |
oct | 703440543713435 |
9 | 131776026580322 |
10 | 31031232010013 |
11 | 99842a953a374 |
12 | 3592088992825 |
13 | 14413040c1191 |
14 | 793cc37011db |
15 | 38c2d83c9128 |
hex | 1c39058f971d |
31031232010013 has 8 divisors (see below), whose sum is σ = 31217309528832. Its totient is φ = 30845157607696.
The previous prime is 31031232009979. The next prime is 31031232010033. The reversal of 31031232010013 is 31001023213013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31031232010013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31031232010033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21017231 + ... + 22445187.
It is an arithmetic number, because the mean of its divisors is an integer number (3902163691104).
Almost surely, 231031232010013 is an apocalyptic number.
It is an amenable number.
31031232010013 is a deficient number, since it is larger than the sum of its proper divisors (186077518819).
31031232010013 is a wasteful number, since it uses less digits than its factorization.
31031232010013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1558251.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31031232010013 its reverse (31001023213013), we get a palindrome (62032255223026).
The spelling of 31031232010013 in words is "thirty-one trillion, thirty-one billion, two hundred thirty-two million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •