Base | Representation |
---|---|
bin | 1110000111001000000111… |
… | …10010001110100111001111 |
3 | 11001212112221211120210120212 |
4 | 13003210003302032213033 |
5 | 13031403400231243203 |
6 | 145555312033233035 |
7 | 6351634055515226 |
oct | 703440362164717 |
9 | 131775854523525 |
10 | 31031202212303 |
11 | 9984293737967 |
12 | 359207aa0277b |
13 | 14412cab8a2b7 |
14 | 793cbd785cbd |
15 | 38c2d59901d8 |
hex | 1c3903c8e9cf |
31031202212303 has 4 divisors (see below), whose sum is σ = 31321213448040. Its totient is φ = 30741190976568.
The previous prime is 31031202212299. The next prime is 31031202212369. The reversal of 31031202212303 is 30321220213013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31031202212303 - 22 = 31031202212299 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 (31031202212383) 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 3 ways as a sum of consecutive naturals, for example, 145005617708 + ... + 145005617921.
It is an arithmetic number, because the mean of its divisors is an integer number (7830303362010).
Almost surely, 231031202212303 is an apocalyptic number.
31031202212303 is a deficient number, since it is larger than the sum of its proper divisors (290011235737).
31031202212303 is a wasteful number, since it uses less digits than its factorization.
31031202212303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290011235736.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 31031202212303 its reverse (30321220213013), we get a palindrome (61352422425316).
The spelling of 31031202212303 in words is "thirty-one trillion, thirty-one billion, two hundred two million, two hundred twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •