Base | Representation |
---|---|
bin | 1010100100000101011110… |
… | …00011101011000100011101 |
3 | 10001020210000000022201020021 |
4 | 11102002233003223010131 |
5 | 11021100241222044123 |
6 | 121223434142152141 |
7 | 4615215013661554 |
oct | 522025703530435 |
9 | 101223000281207 |
10 | 23230120112413 |
11 | 74469252171a5 |
12 | 27321a0282651 |
13 | cc678b361016 |
14 | 5a44b55c8d9b |
15 | 2a4406ea1c5d |
hex | 1520af0eb11d |
23230120112413 has 4 divisors (see below), whose sum is σ = 23340215468608. Its totient is φ = 23120024756220.
The previous prime is 23230120112401. The next prime is 23230120112489. The reversal of 23230120112413 is 31421102103232.
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 23230120112413 - 29 = 23230120111901 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 (23230120113413) 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, 55047677781 + ... + 55047678202.
It is an arithmetic number, because the mean of its divisors is an integer number (5835053867152).
Almost surely, 223230120112413 is an apocalyptic number.
It is an amenable number.
23230120112413 is a deficient number, since it is larger than the sum of its proper divisors (110095356195).
23230120112413 is a wasteful number, since it uses less digits than its factorization.
23230120112413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110095356194.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 23230120112413 its reverse (31421102103232), we get a palindrome (54651222215645).
The spelling of 23230120112413 in words is "twenty-three trillion, two hundred thirty billion, one hundred twenty million, one hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •