Base | Representation |
---|---|
bin | 1010100000010111011011… |
… | …01101000001100100101011 |
3 | 10000210120010112212002112011 |
4 | 11100023231231001210223 |
5 | 11012002023430333003 |
6 | 121045021003500351 |
7 | 4603042035660406 |
oct | 520135555014453 |
9 | 100716115762464 |
10 | 23102322121003 |
11 | 73a7704619784 |
12 | 2711474b276b7 |
13 | cb7702742168 |
14 | 59c230760d3d |
15 | 2a0e2760546d |
hex | 1502edb4192b |
23102322121003 has 4 divisors (see below), whose sum is σ = 23314270030480. Its totient is φ = 22890374211528.
The previous prime is 23102322120979. The next prime is 23102322121027. The reversal of 23102322121003 is 30012122320132.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (23102322120979) and next prime (23102322121027).
It is a cyclic number.
It is not a de Polignac number, because 23102322121003 - 217 = 23102321989931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23102322161003) 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, 105973954575 + ... + 105973954792.
It is an arithmetic number, because the mean of its divisors is an integer number (5828567507620).
Almost surely, 223102322121003 is an apocalyptic number.
23102322121003 is a deficient number, since it is larger than the sum of its proper divisors (211947909477).
23102322121003 is a wasteful number, since it uses less digits than its factorization.
23102322121003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211947909476.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 23102322121003 its reverse (30012122320132), we get a palindrome (53114444441135).
The spelling of 23102322121003 in words is "twenty-three trillion, one hundred two billion, three hundred twenty-two million, one hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •