Base | Representation |
---|---|
bin | 1100110111010101011… |
… | …1000001000011110101 |
3 | 210010110201122010022112 |
4 | 3031311113001003311 |
5 | 12110113122100041 |
6 | 245310500340405 |
7 | 21652614360632 |
oct | 3156527010365 |
9 | 703421563275 |
10 | 221012300021 |
11 | 85804755207 |
12 | 36a006a4705 |
13 | 17ac264c6b6 |
14 | a9a89d7189 |
15 | 5b38000deb |
hex | 33755c10f5 |
221012300021 has 4 divisors (see below), whose sum is σ = 221031618912. Its totient is φ = 220992981132.
The previous prime is 221012300017. The next prime is 221012300039. The reversal of 221012300021 is 120003210122.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 221012300021 - 22 = 221012300017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221012299969 and 221012300005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221012300081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9642275 + ... + 9665168.
It is an arithmetic number, because the mean of its divisors is an integer number (55257904728).
Almost surely, 2221012300021 is an apocalyptic number.
It is an amenable number.
221012300021 is a deficient number, since it is larger than the sum of its proper divisors (19318891).
221012300021 is a wasteful number, since it uses less digits than its factorization.
221012300021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19318890.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 221012300021 its reverse (120003210122), we get a palindrome (341015510143).
The spelling of 221012300021 in words is "two hundred twenty-one billion, twelve million, three hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •