Base | Representation |
---|---|
bin | 110100100100110110110101… |
… | …101101110110100111000101 |
3 | 1010022201111011010000010021112 |
4 | 310210312311231312213011 |
5 | 220301443000432323023 |
6 | 2135442052002054405 |
7 | 66463621524644462 |
oct | 6444666555664705 |
9 | 1108644133003245 |
10 | 231231203011013 |
11 | 6774a669a074a7 |
12 | 21b261a604a405 |
13 | 9c04016687a4a |
14 | 4115915618669 |
15 | 1baecc30b0478 |
hex | d24db5b769c5 |
231231203011013 has 16 divisors (see below), whose sum is σ = 240980139771840. Its totient is φ = 221694011932800.
The previous prime is 231231203010967. The next prime is 231231203011057. The reversal of 231231203011013 is 310110302132132.
It is a cyclic number.
It is not a de Polignac number, because 231231203011013 - 26 = 231231203010949 is a prime.
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 231231203011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231231203011073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99297578 + ... + 101599563.
It is an arithmetic number, because the mean of its divisors is an integer number (15061258735740).
Almost surely, 2231231203011013 is an apocalyptic number.
It is an amenable number.
231231203011013 is a deficient number, since it is larger than the sum of its proper divisors (9748936760827).
231231203011013 is a wasteful number, since it uses less digits than its factorization.
231231203011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200897668.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 231231203011013 its reverse (310110302132132), we get a palindrome (541341505143145).
The spelling of 231231203011013 in words is "two hundred thirty-one trillion, two hundred thirty-one billion, two hundred three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •