Base | Representation |
---|---|
bin | 10100011111010111… |
… | …001100011000011001 |
3 | 2002210021210010012200 |
4 | 110133113030120121 |
5 | 330024224311301 |
6 | 14035050000413 |
7 | 1406130333612 |
oct | 243727143031 |
9 | 62707703180 |
10 | 22001010201 |
11 | 936aaa6665 |
12 | 4320116109 |
13 | 20c8116a41 |
14 | 10c9d64c09 |
15 | 88b77cc86 |
hex | 51f5cc619 |
22001010201 has 6 divisors (see below), whose sum is σ = 31779236970. Its totient is φ = 14667340128.
The previous prime is 22001010191. The next prime is 22001010221. The reversal of 22001010201 is 10201010022.
It can be written as a sum of positive squares in only one way, i.e., 13122848025 + 8878162176 = 114555^2 + 94224^2 .
It is not a de Polignac number, because 22001010201 - 25 = 22001010169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2444556689 = 22001010201 / (2 + 2 + 0 + 0 + 1 + 0 + 1 + 0 + 2 + 0 + 1).
It is not an unprimeable number, because it can be changed into a prime (22001010221) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1222278336 + ... + 1222278353.
It is an arithmetic number, because the mean of its divisors is an integer number (5296539495).
Almost surely, 222001010201 is an apocalyptic number.
It is an amenable number.
22001010201 is a deficient number, since it is larger than the sum of its proper divisors (9778226769).
22001010201 is a wasteful number, since it uses less digits than its factorization.
22001010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444556695 (or 2444556692 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 22001010201 its reverse (10201010022), we get a palindrome (32202020223).
The spelling of 22001010201 in words is "twenty-two billion, one million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.690 sec. • engine limits •