Base | Representation |
---|---|
bin | 1001101001011010100101… |
… | …10001100100101100100000 |
3 | 2210010001122022120101111101 |
4 | 10310231102301210230200 |
5 | 10240033221420431031 |
6 | 113041403404124144 |
7 | 4316451310320160 |
oct | 464552261445440 |
9 | 83101568511441 |
10 | 21214232202016 |
11 | 68399a602a157 |
12 | 2467563536654 |
13 | bab65532ac49 |
14 | 534abaa245a0 |
15 | 26bc6e270361 |
hex | 134b52c64b20 |
21214232202016 has 24 divisors (see below), whose sum is σ = 47732022455040. Its totient is φ = 9091813800768.
The previous prime is 21214232202001. The next prime is 21214232202019. The reversal of 21214232202016 is 61020223241212.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (21214232202019) 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 3 ways as a sum of consecutive naturals, for example, 47353196656 + ... + 47353197103.
It is an arithmetic number, because the mean of its divisors is an integer number (1988834268960).
Almost surely, 221214232202016 is an apocalyptic number.
It is an amenable number.
21214232202016 is an abundant number, since it is smaller than the sum of its proper divisors (26517790253024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21214232202016 is an equidigital number, since it uses as much as digits as its factorization.
21214232202016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94706393776 (or 94706393768 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 21214232202016 its reverse (61020223241212), we get a palindrome (82234455443228).
The spelling of 21214232202016 in words is "twenty-one trillion, two hundred fourteen billion, two hundred thirty-two million, two hundred two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •