Base | Representation |
---|---|
bin | 10100011111010111… |
… | …111101001011110101 |
3 | 2002210022011021102101 |
4 | 110133113331023311 |
5 | 330024302210401 |
6 | 14035054142101 |
7 | 1406132125453 |
oct | 243727751365 |
9 | 62708137371 |
10 | 22001210101 |
11 | 9370122872 |
12 | 43201b1931 |
13 | 20c8186a20 |
14 | 10c9db79d3 |
15 | 88b7bc101 |
hex | 51f5fd2f5 |
22001210101 has 4 divisors (see below), whose sum is σ = 23693610892. Its totient is φ = 20308809312.
The previous prime is 22001210081. The next prime is 22001210111. The reversal of 22001210101 is 10101210022.
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 7460467876 + 14540742225 = 86374^2 + 120585^2 .
It is a cyclic number.
It is not a de Polignac number, because 22001210101 - 25 = 22001210069 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 (22001210111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 846200376 + ... + 846200401.
It is an arithmetic number, because the mean of its divisors is an integer number (5923402723).
Almost surely, 222001210101 is an apocalyptic number.
It is an amenable number.
22001210101 is a deficient number, since it is larger than the sum of its proper divisors (1692400791).
22001210101 is a wasteful number, since it uses less digits than its factorization.
22001210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1692400790.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 22001210101 its reverse (10101210022), we get a palindrome (32102420123).
The spelling of 22001210101 in words is "twenty-two billion, one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •