Base | Representation |
---|---|
bin | 1010011110000100100000… |
… | …00110000011100101010011 |
3 | 10000112000112021101121011111 |
4 | 11033002100012003211103 |
5 | 11004204002201310303 |
6 | 120544453501354151 |
7 | 4564250234553625 |
oct | 517022006034523 |
9 | 100460467347144 |
10 | 23023442213203 |
11 | 7377206a00533 |
12 | 26ba120268957 |
13 | cb01416a43c3 |
14 | 5984aa674c15 |
15 | 29dd5c63ab6d |
hex | 14f090183953 |
23023442213203 has 8 divisors (see below), whose sum is σ = 24138321451776. Its totient is φ = 21918051309000.
The previous prime is 23023442213147. The next prime is 23023442213209. The reversal of 23023442213203 is 30231224432032.
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 23023442213203 - 217 = 23023442082131 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23023442213209) 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, 2372078623 + ... + 2372088328.
It is an arithmetic number, because the mean of its divisors is an integer number (3017290181472).
Almost surely, 223023442213203 is an apocalyptic number.
23023442213203 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23023442213203 is a deficient number, since it is larger than the sum of its proper divisors (1114879238573).
23023442213203 is a wasteful number, since it uses less digits than its factorization.
23023442213203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4744167185.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 23023442213203 its reverse (30231224432032), we get a palindrome (53254666645235).
The spelling of 23023442213203 in words is "twenty-three trillion, twenty-three billion, four hundred forty-two million, two hundred thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •