Base | Representation |
---|---|
bin | 1110000110010011110011… |
… | …00010100000001001000101 |
3 | 11001202212110020211111121110 |
4 | 13003021321202200021011 |
5 | 13030423333413431323 |
6 | 145534344500435233 |
7 | 6346621020433122 |
oct | 703117142401105 |
9 | 131685406744543 |
10 | 31003113030213 |
11 | 997338a068695 |
12 | 358873b9a8b19 |
13 | 143b7726459ac |
14 | 7927b701d749 |
15 | 38b6de9ae793 |
hex | 1c32798a0245 |
31003113030213 has 12 divisors (see below), whose sum is σ = 43912137026720. Its totient is φ = 19452933665472.
The previous prime is 31003113030151. The next prime is 31003113030271. The reversal of 31003113030213 is 31203031130013.
It is not a de Polignac number, because 31003113030213 - 232 = 30998818062917 is a prime.
It is a super-2 number, since 2×310031130302132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31003113030213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31003113030313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17879533753 + ... + 17879535486.
Almost surely, 231003113030213 is an apocalyptic number.
It is an amenable number.
31003113030213 is a deficient number, since it is larger than the sum of its proper divisors (12909023996507).
31003113030213 is a wasteful number, since it uses less digits than its factorization.
31003113030213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35759069276 (or 35759069259 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 31003113030213 its reverse (31203031130013), we get a palindrome (62206144160226).
The spelling of 31003113030213 in words is "thirty-one trillion, three billion, one hundred thirteen million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •