Base | Representation |
---|---|
bin | 1010100011110010110111… |
… | …01011000000010001001011 |
3 | 10001012211012212102111022220 |
4 | 11101321123223000101023 |
5 | 11020414312041431443 |
6 | 121215103033145123 |
7 | 4614412332435252 |
oct | 521713353002113 |
9 | 101184185374286 |
10 | 23220131202123 |
11 | 7442669797039 |
12 | 2730272b5b1a3 |
13 | cc5858a5740b |
14 | 5a3c08b11799 |
15 | 2a4020084a83 |
hex | 151e5bac044b |
23220131202123 has 16 divisors (see below), whose sum is σ = 31062792384000. Its totient is φ = 15428788575680.
The previous prime is 23220131202061. The next prime is 23220131202143. The reversal of 23220131202123 is 32120213102232.
It is a cyclic number.
It is not a de Polignac number, because 23220131202123 - 28 = 23220131201867 is a prime.
It is a super-2 number, since 2×232201312021232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23220131202093 and 23220131202102.
It is not an unprimeable number, because it can be changed into a prime (23220131202143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8263978 + ... + 10711376.
It is an arithmetic number, because the mean of its divisors is an integer number (1941424524000).
Almost surely, 223220131202123 is an apocalyptic number.
23220131202123 is a deficient number, since it is larger than the sum of its proper divisors (7842661181877).
23220131202123 is a wasteful number, since it uses less digits than its factorization.
23220131202123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457882.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 23220131202123 its reverse (32120213102232), we get a palindrome (55340344304355).
The spelling of 23220131202123 in words is "twenty-three trillion, two hundred twenty billion, one hundred thirty-one million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •