Base | Representation |
---|---|
bin | 1001101001100101010111… |
… | …10100011110010111000111 |
3 | 2210010121120202101222102100 |
4 | 10310302223310132113013 |
5 | 10240132100400231043 |
6 | 113044202040243143 |
7 | 4320044622210522 |
oct | 464625364362707 |
9 | 83117522358370 |
10 | 21220021102023 |
11 | 68413a6786437 |
12 | 24686ba1704b3 |
13 | bac068754273 |
14 | 5350a97a1bb9 |
15 | 26beac5a9cd3 |
hex | 134cabd1e5c7 |
21220021102023 has 48 divisors (see below), whose sum is σ = 31921446997440. Its totient is φ = 13566970368000.
The previous prime is 21220021102001. The next prime is 21220021102039. The reversal of 21220021102023 is 32020112002212.
21220021102023 is a `hidden beast` number, since 212 + 200 + 211 + 0 + 20 + 23 = 666.
It is not a de Polignac number, because 21220021102023 - 221 = 21220019004871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21220021101987 and 21220021102005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220021100023) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 470268903 + ... + 470314023.
It is an arithmetic number, because the mean of its divisors is an integer number (665030145780).
Almost surely, 221220021102023 is an apocalyptic number.
21220021102023 is a deficient number, since it is larger than the sum of its proper divisors (10701425895417).
21220021102023 is a wasteful number, since it uses less digits than its factorization.
21220021102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57240 (or 57237 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 21220021102023 its reverse (32020112002212), we get a palindrome (53240133104235).
The spelling of 21220021102023 in words is "twenty-one trillion, two hundred twenty billion, twenty-one million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •