Base | Representation |
---|---|
bin | 1001101100100000000000… |
… | …01101001101111000110110 |
3 | 2210111012012212102101122010 |
4 | 10312100000031031320312 |
5 | 10243302303101401402 |
6 | 113202212510345050 |
7 | 4330222645266120 |
oct | 466200015157066 |
9 | 83435185371563 |
10 | 21320221122102 |
11 | 687a945008591 |
12 | 2484002abb186 |
13 | bb8646827186 |
14 | 539c9320c210 |
15 | 26e8c4154a6c |
hex | 13640034de36 |
21320221122102 has 32 divisors (see below), whose sum is σ = 49920517753344. Its totient is φ = 5942918779200.
The previous prime is 21320221122037. The next prime is 21320221122107. The reversal of 21320221122102 is 20122112202312.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21320221122107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6190538674 + ... + 6190542117.
It is an arithmetic number, because the mean of its divisors is an integer number (1560016179792).
Almost surely, 221320221122102 is an apocalyptic number.
21320221122102 is an abundant number, since it is smaller than the sum of its proper divisors (28600296631242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21320221122102 is a wasteful number, since it uses less digits than its factorization.
21320221122102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12381080844.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21320221122102 its reverse (20122112202312), we get a palindrome (41442333324414).
The spelling of 21320221122102 in words is "twenty-one trillion, three hundred twenty billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •