Base | Representation |
---|---|
bin | 1001100110011000110100… |
… | …00010011111010100010111 |
3 | 2202202010010012201212022121 |
4 | 10303030122002133110113 |
5 | 10231332142441320043 |
6 | 112521520441040411 |
7 | 4306106314602061 |
oct | 463143202372427 |
9 | 82663105655277 |
10 | 21110201120023 |
11 | 67a9871210534 |
12 | 244b36b786107 |
13 | ba18b66364b2 |
14 | 52da4c47c731 |
15 | 2691d11c0ded |
hex | 13331a09f517 |
21110201120023 has 8 divisors (see below), whose sum is σ = 21185493170400. Its totient is φ = 21034956593280.
The previous prime is 21110201119999. The next prime is 21110201120039. The reversal of 21110201120023 is 32002110201112.
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 21110201120023 - 25 = 21110201119991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110201119979 and 21110201120006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110201120123) 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, 10990798 + ... + 12767851.
It is an arithmetic number, because the mean of its divisors is an integer number (2648186646300).
Almost surely, 221110201120023 is an apocalyptic number.
21110201120023 is a deficient number, since it is larger than the sum of its proper divisors (75292050377).
21110201120023 is a wasteful number, since it uses less digits than its factorization.
21110201120023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23761817.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21110201120023 its reverse (32002110201112), we get a palindrome (53112311321135).
The spelling of 21110201120023 in words is "twenty-one trillion, one hundred ten billion, two hundred one million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •