Base | Representation |
---|---|
bin | 110100101000111010011111… |
… | …101000010000100101001101 |
3 | 1010100201010210022201212120222 |
4 | 310220322133220100211031 |
5 | 220321024442330220023 |
6 | 2140214121143121125 |
7 | 66523021515322550 |
oct | 6450723750204515 |
9 | 1110633708655528 |
10 | 231510005320013 |
11 | 67847929605802 |
12 | 21b702344431a5 |
13 | 9c243b8945514 |
14 | 4125203386697 |
15 | 1bb718e7c1cc8 |
hex | d28e9fa1094d |
231510005320013 has 32 divisors (see below), whose sum is σ = 266288327165952. Its totient is φ = 197160130252800.
The previous prime is 231510005319979. The next prime is 231510005320049. The reversal of 231510005320013 is 310023500015132.
It is a cyclic number.
It is not a de Polignac number, because 231510005320013 - 212 = 231510005315917 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231510005323013) by changing a digit.
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, 8344794020 + ... + 8344821762.
It is an arithmetic number, because the mean of its divisors is an integer number (8321510223936).
Almost surely, 2231510005320013 is an apocalyptic number.
It is an amenable number.
231510005320013 is a deficient number, since it is larger than the sum of its proper divisors (34778321845939).
231510005320013 is a wasteful number, since it uses less digits than its factorization.
231510005320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33725.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 231510005320013 its reverse (310023500015132), we get a palindrome (541533505335145).
The spelling of 231510005320013 in words is "two hundred thirty-one trillion, five hundred ten billion, five million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •