Base | Representation |
---|---|
bin | 1110001001100000111001… |
… | …00110110101000010110011 |
3 | 11002011101200000020012110020 |
4 | 13010300130212311002303 |
5 | 13034224340044024021 |
6 | 150101114540134523 |
7 | 6360566446136340 |
oct | 704603446650263 |
9 | 132141600205406 |
10 | 31113223033011 |
11 | 9a060533114a9 |
12 | 35a5b4b537443 |
13 | 1448c6c8792c2 |
14 | 797c60a797c7 |
15 | 38e4d65857c6 |
hex | 1c4c1c9b50b3 |
31113223033011 has 32 divisors (see below), whose sum is σ = 51626815526400. Its totient is φ = 16262446878720.
The previous prime is 31113223033003. The next prime is 31113223033019. The reversal of 31113223033011 is 11033032231113.
It is an interprime number because it is at equal distance from previous prime (31113223033003) and next prime (31113223033019).
It is not a de Polignac number, because 31113223033011 - 23 = 31113223033003 is a prime.
It is a super-2 number, since 2×311132230330112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31113223033019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1344436750 + ... + 1344459891.
It is an arithmetic number, because the mean of its divisors is an integer number (1613337985200).
Almost surely, 231113223033011 is an apocalyptic number.
31113223033011 is a deficient number, since it is larger than the sum of its proper divisors (20513592493389).
31113223033011 is a wasteful number, since it uses less digits than its factorization.
31113223033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2688896699.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31113223033011 its reverse (11033032231113), we get a palindrome (42146255264124).
The spelling of 31113223033011 in words is "thirty-one trillion, one hundred thirteen billion, two hundred twenty-three million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •