Base | Representation |
---|---|
bin | 1110001001110011001000… |
… | …00001110011001010010001 |
3 | 11002012022221011102121220110 |
4 | 13010321210001303022101 |
5 | 13034404411333020423 |
6 | 150105414115031533 |
7 | 6361364142304101 |
oct | 704714401631221 |
9 | 132168834377813 |
10 | 31123011220113 |
11 | 9a0a21650532a |
12 | 35a7a2159b5a9 |
13 | 1449b6c7046a7 |
14 | 79850ca23201 |
15 | 38e8aaa54193 |
hex | 1c4e64073291 |
31123011220113 has 16 divisors (see below), whose sum is σ = 43938485859456. Its totient is φ = 19528111868160.
The previous prime is 31123011220111. The next prime is 31123011220127. The reversal of 31123011220113 is 31102211032113.
It is not a de Polignac number, because 31123011220113 - 21 = 31123011220111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31123011220113.
It is not an unprimeable number, because it can be changed into a prime (31123011220111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29453148 + ... + 30491538.
It is an arithmetic number, because the mean of its divisors is an integer number (2746155366216).
Almost surely, 231123011220113 is an apocalyptic number.
It is an amenable number.
31123011220113 is a deficient number, since it is larger than the sum of its proper divisors (12815474639343).
31123011220113 is a wasteful number, since it uses less digits than its factorization.
31123011220113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626104.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 31123011220113 its reverse (31102211032113), we get a palindrome (62225222252226).
The spelling of 31123011220113 in words is "thirty-one trillion, one hundred twenty-three billion, eleven million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •