Base | Representation |
---|---|
bin | 1010100000010100000010… |
… | …10011100101110000001001 |
3 | 10000210101102210211021212201 |
4 | 11100022001103211300021 |
5 | 11011434312344422441 |
6 | 121044120320440201 |
7 | 4602646004035465 |
oct | 520120123456011 |
9 | 100711383737781 |
10 | 23100503514121 |
11 | 73a6961006490 |
12 | 2711047a79061 |
13 | cb74a2a38b07 |
14 | 59c0db0034a5 |
15 | 2a0d6cb23c31 |
hex | 1502814e5c09 |
23100503514121 has 4 divisors (see below), whose sum is σ = 25200549288144. Its totient is φ = 21000457740100.
The previous prime is 23100503514119. The next prime is 23100503514133. The reversal of 23100503514121 is 12141530500132.
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 23100503514121 - 21 = 23100503514119 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 23100503514121.
It is not an unprimeable number, because it can be changed into a prime (23100503514421) 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, 1050022886995 + ... + 1050022887016.
It is an arithmetic number, because the mean of its divisors is an integer number (6300137322036).
Almost surely, 223100503514121 is an apocalyptic number.
It is an amenable number.
23100503514121 is a deficient number, since it is larger than the sum of its proper divisors (2100045774023).
23100503514121 is a wasteful number, since it uses less digits than its factorization.
23100503514121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2100045774022.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 23100503514121 in words is "twenty-three trillion, one hundred billion, five hundred three million, five hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •