Base | Representation |
---|---|
bin | 1010011110010010110100… |
… | …10101011010001110001111 |
3 | 10000112202101001200221120012 |
4 | 11033021122111122032033 |
5 | 11004320223312444043 |
6 | 120552204413543435 |
7 | 4564641606443255 |
oct | 517113225321617 |
9 | 100482331627505 |
10 | 23031130203023 |
11 | 737a4a1641028 |
12 | 26bb706aa4b7b |
13 | cb0a983a2bc7 |
14 | 5989d97205d5 |
15 | 29e15c553a18 |
hex | 14f25a55a38f |
23031130203023 has 8 divisors (see below), whose sum is σ = 23097166902528. Its totient is φ = 22965111338904.
The previous prime is 23031130202957. The next prime is 23031130203167. The reversal of 23031130203023 is 32030203113032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23031130203023 - 212 = 23031130198927 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 23031130203023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23031130209023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1870361 + ... + 7039922.
It is an arithmetic number, because the mean of its divisors is an integer number (2887145862816).
Almost surely, 223031130203023 is an apocalyptic number.
23031130203023 is a deficient number, since it is larger than the sum of its proper divisors (66036699505).
23031130203023 is an equidigital number, since it uses as much as digits as its factorization.
23031130203023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8917693.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 23031130203023 its reverse (32030203113032), we get a palindrome (55061333316055).
The spelling of 23031130203023 in words is "twenty-three trillion, thirty-one billion, one hundred thirty million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •