Base | Representation |
---|---|
bin | 1001101001000010010100… |
… | …00000000011101010000111 |
3 | 2210001211000002101010010021 |
4 | 10310201022000003222013 |
5 | 10234330024211231043 |
6 | 113031410305040011 |
7 | 4315510334306434 |
oct | 464411200035207 |
9 | 83054002333107 |
10 | 21201200102023 |
11 | 683441881a587 |
12 | 2464b27026007 |
13 | baa3593ca486 |
14 | 534201d00b8b |
15 | 26b75a0cc3ed |
hex | 13484a003a87 |
21201200102023 has 8 divisors (see below), whose sum is σ = 21937883928480. Its totient is φ = 20464890139680.
The previous prime is 21201200102003. The next prime is 21201200102051. The reversal of 21201200102023 is 32020100210212.
It is a happy number.
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 21201200102023 - 213 = 21201200093831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21201200101988 and 21201200102006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201200102003) 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, 93350640 + ... + 93577477.
It is an arithmetic number, because the mean of its divisors is an integer number (2742235491060).
Almost surely, 221201200102023 is an apocalyptic number.
21201200102023 is a deficient number, since it is larger than the sum of its proper divisors (736683826457).
21201200102023 is a wasteful number, since it uses less digits than its factorization.
21201200102023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186932057.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 21201200102023 its reverse (32020100210212), we get a palindrome (53221300312235).
The spelling of 21201200102023 in words is "twenty-one trillion, two hundred one billion, two hundred million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •