Base | Representation |
---|---|
bin | 1010100000111000010111… |
… | …11111101110101110101111 |
3 | 10000212020210021010010101201 |
4 | 11100130023333232232233 |
5 | 11012244240103211343 |
6 | 121101104104550331 |
7 | 4604236256154553 |
oct | 520341377565657 |
9 | 100766707103351 |
10 | 23120010210223 |
11 | 7404161031a33 |
12 | 27149907823a7 |
13 | cb9291164444 |
14 | 59d02b997863 |
15 | 2a16103ea94d |
hex | 15070bfeebaf |
23120010210223 has 8 divisors (see below), whose sum is σ = 23917308562800. Its totient is φ = 22322715632448.
The previous prime is 23120010210151. The next prime is 23120010210239. The reversal of 23120010210223 is 32201201002132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23120010210223 - 213 = 23120010202031 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 23120010210223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23120010211223) 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, 17884188 + ... + 19133326.
It is an arithmetic number, because the mean of its divisors is an integer number (2989663570350).
Almost surely, 223120010210223 is an apocalyptic number.
23120010210223 is a deficient number, since it is larger than the sum of its proper divisors (797298352577).
23120010210223 is a wasteful number, since it uses less digits than its factorization.
23120010210223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1887401.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 23120010210223 its reverse (32201201002132), we get a palindrome (55321211212355).
The spelling of 23120010210223 in words is "twenty-three trillion, one hundred twenty billion, ten million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •