Base | Representation |
---|---|
bin | 10011100101000000… |
… | …111111010100100101 |
3 | 2000021001210212222012 |
4 | 103211000333110211 |
5 | 321023130023023 |
6 | 13354000444005 |
7 | 1342642665251 |
oct | 234500772445 |
9 | 60231725865 |
10 | 21022111013 |
11 | 8a08485172 |
12 | 40a8319605 |
13 | 1ca0387057 |
14 | 1035d4b261 |
15 | 830868978 |
hex | 4e503f525 |
21022111013 has 4 divisors (see below), whose sum is σ = 21230250828. Its totient is φ = 20813971200.
The previous prime is 21022110997. The next prime is 21022111027. The reversal of 21022111013 is 31011122012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16082551489 + 4939559524 = 126817^2 + 70282^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022111013 - 24 = 21022110997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21022111093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104069756 + ... + 104069957.
It is an arithmetic number, because the mean of its divisors is an integer number (5307562707).
Almost surely, 221022111013 is an apocalyptic number.
It is an amenable number.
21022111013 is a deficient number, since it is larger than the sum of its proper divisors (208139815).
21022111013 is a wasteful number, since it uses less digits than its factorization.
21022111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208139814.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 21022111013 its reverse (31011122012), we get a palindrome (52033233025).
The spelling of 21022111013 in words is "twenty-one billion, twenty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •