Base | Representation |
---|---|
bin | 1010100000010101001011… |
… | …00010000111011111101001 |
3 | 10000210110000011111010021101 |
4 | 11100022211202013133221 |
5 | 11011442033443131441 |
6 | 121044300511441401 |
7 | 4603000034122246 |
oct | 520124542073751 |
9 | 100713004433241 |
10 | 23101111302121 |
11 | 73a71430a3616 |
12 | 2711197526261 |
13 | cb756b930498 |
14 | 59c157a165cd |
15 | 2a0da617e231 |
hex | 1502a58877e9 |
23101111302121 has 8 divisors (see below), whose sum is σ = 23267537820800. Its totient is φ = 22934688090480.
The previous prime is 23101111302119. The next prime is 23101111302151. The reversal of 23101111302121 is 12120311110132.
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 23101111302121 - 21 = 23101111302119 is a prime.
It is a super-2 number, since 2×231011113021212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23101111302151) 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, 14170816 + ... + 15716686.
It is an arithmetic number, because the mean of its divisors is an integer number (2908442227600).
Almost surely, 223101111302121 is an apocalyptic number.
It is an amenable number.
23101111302121 is a deficient number, since it is larger than the sum of its proper divisors (166426518679).
23101111302121 is a wasteful number, since it uses less digits than its factorization.
23101111302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1653519.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 23101111302121 its reverse (12120311110132), we get a palindrome (35221422412253).
The spelling of 23101111302121 in words is "twenty-three trillion, one hundred one billion, one hundred eleven million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •