Base | Representation |
---|---|
bin | 110100100100110111111000… |
… | …010111000100010001001001 |
3 | 1010022201121001000220111021100 |
4 | 310210313320113010101021 |
5 | 220302002243201023423 |
6 | 2135442354542532013 |
7 | 66463661322434520 |
oct | 6444677027042111 |
9 | 1108647030814240 |
10 | 231232321111113 |
11 | 67750093064673 |
12 | 21b26458597009 |
13 | 9c0416420513a |
14 | 41159bdd094b7 |
15 | 1baed3b31e343 |
hex | d24df85c4449 |
231232321111113 has 48 divisors (see below), whose sum is σ = 384204699680256. Its totient is φ = 131273016716160.
The previous prime is 231232321111109. The next prime is 231232321111147. The reversal of 231232321111113 is 311111123232132.
231232321111113 is a `hidden beast` number, since 2 + 3 + 1 + 2 + 323 + 211 + 11 + 113 = 666.
It is not a de Polignac number, because 231232321111113 - 22 = 231232321111109 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (231232321111153) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1542256 + ... + 21560222.
It is an arithmetic number, because the mean of its divisors is an integer number (8004264576672).
Almost surely, 2231232321111113 is an apocalyptic number.
It is an amenable number.
231232321111113 is a deficient number, since it is larger than the sum of its proper divisors (152972378569143).
231232321111113 is a wasteful number, since it uses less digits than its factorization.
231232321111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20019174 (or 20019171 counting only the distinct ones).
The product of its digits is 1296, while the sum is 27.
Adding to 231232321111113 its reverse (311111123232132), we get a palindrome (542343444343245).
The spelling of 231232321111113 in words is "two hundred thirty-one trillion, two hundred thirty-two billion, three hundred twenty-one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •