Base | Representation |
---|---|
bin | 1010011110010010110001… |
… | …00110100000100100000101 |
3 | 10000112202022000222221021002 |
4 | 11033021120212200210011 |
5 | 11004320143342143023 |
6 | 120552201454503045 |
7 | 4564641104361233 |
oct | 517113046404405 |
9 | 100482260887232 |
10 | 23031101131013 |
11 | 737a487194878 |
12 | 26bb6b9204a85 |
13 | cb0a92364431 |
14 | 5989d5913953 |
15 | 29e159c0eb28 |
hex | 14f2589a0905 |
23031101131013 has 4 divisors (see below), whose sum is σ = 23159766500640. Its totient is φ = 22902435761388.
The previous prime is 23031101130949. The next prime is 23031101131069. The reversal of 23031101131013 is 31013110113032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23031101131013 - 26 = 23031101130949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23031106131013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64332684545 + ... + 64332684902.
It is an arithmetic number, because the mean of its divisors is an integer number (5789941625160).
Almost surely, 223031101131013 is an apocalyptic number.
It is an amenable number.
23031101131013 is a deficient number, since it is larger than the sum of its proper divisors (128665369627).
23031101131013 is a wasteful number, since it uses less digits than its factorization.
23031101131013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128665369626.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 23031101131013 its reverse (31013110113032), we get a palindrome (54044211244045).
The spelling of 23031101131013 in words is "twenty-three trillion, thirty-one billion, one hundred one million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •