Base | Representation |
---|---|
bin | 1001100011110011001110… |
… | …01111101001100000000110 |
3 | 2202102121122200112211120100 |
4 | 10301321213033221200012 |
5 | 10223403111314231042 |
6 | 112413015230344530 |
7 | 4266511314451425 |
oct | 461714717514006 |
9 | 82377580484510 |
10 | 21021302102022 |
11 | 67750a2015522 |
12 | 243609b65b146 |
13 | b963b9949b71 |
14 | 5296178972bc |
15 | 266c2b82124c |
hex | 131e673e9806 |
21021302102022 has 24 divisors (see below), whose sum is σ = 45546901026120. Its totient is φ = 7006985858880.
The previous prime is 21021302101999. The next prime is 21021302102029. The reversal of 21021302102022 is 22020120312012.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21021302101986 and 21021302102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021302102029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8437747 + ... + 10641342.
It is an arithmetic number, because the mean of its divisors is an integer number (1897787542755).
Almost surely, 221021302102022 is an apocalyptic number.
21021302102022 is an abundant number, since it is smaller than the sum of its proper divisors (24525598924098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21021302102022 is a wasteful number, since it uses less digits than its factorization.
21021302102022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19140308 (or 19140305 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 21021302102022 its reverse (22020120312012), we get a palindrome (43041422414034).
The spelling of 21021302102022 in words is "twenty-one trillion, twenty-one billion, three hundred two million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •