Base | Representation |
---|---|
bin | 1110001001100000101101… |
… | …00101110101111101000110 |
3 | 11002011101101222022211220011 |
4 | 13010300112211311331012 |
5 | 13034224133230030202 |
6 | 150101100533100434 |
7 | 6360564112255060 |
oct | 704602645657506 |
9 | 132141358284804 |
10 | 31113122111302 |
11 | 9a06001350530 |
12 | 35a5b2178771a |
13 | 1448c549a210a |
14 | 797c514c8730 |
15 | 38e4cc79cbd7 |
hex | 1c4c16975f46 |
31113122111302 has 64 divisors (see below), whose sum is σ = 61676190153216. Its totient is φ = 11396357429760.
The previous prime is 31113122111261. The next prime is 31113122111317. The reversal of 31113122111302 is 20311122131113.
It is a super-2 number, since 2×311131221113022 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4176913 + ... + 8925964.
It is an arithmetic number, because the mean of its divisors is an integer number (963690471144).
Almost surely, 231113122111302 is an apocalyptic number.
31113122111302 is a deficient number, since it is larger than the sum of its proper divisors (30563068041914).
31113122111302 is a wasteful number, since it uses less digits than its factorization.
31113122111302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13103821.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 31113122111302 its reverse (20311122131113), we get a palindrome (51424244242415).
The spelling of 31113122111302 in words is "thirty-one trillion, one hundred thirteen billion, one hundred twenty-two million, one hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •