Base | Representation |
---|---|
bin | 111110101001101… |
… | …0000101010101001 |
3 | 12102111122212122100 |
4 | 1331103100222221 |
5 | 13301130413001 |
6 | 544333244013 |
7 | 103044261615 |
oct | 17523205251 |
9 | 5374585570 |
10 | 2102201001 |
11 | 9897017aa |
12 | 4a8033609 |
13 | 2766ab924 |
14 | 15d2a0345 |
15 | c484e586 |
hex | 7d4d0aa9 |
2102201001 has 6 divisors (see below), whose sum is σ = 3036512570. Its totient is φ = 1401467328.
The previous prime is 2102200979. The next prime is 2102201027. The reversal of 2102201001 is 1001022012.
It can be written as a sum of positive squares in only one way, i.e., 1232010000 + 870191001 = 35100^2 + 29499^2 .
It is not a de Polignac number, because 2102201001 - 26 = 2102200937 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: 233577889 = 2102201001 / (2 + 1 + 0 + 2 + 2 + 0 + 1 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102201051) 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, 116788936 + ... + 116788953.
Almost surely, 22102201001 is an apocalyptic number.
It is an amenable number.
2102201001 is a deficient number, since it is larger than the sum of its proper divisors (934311569).
2102201001 is a wasteful number, since it uses less digits than its factorization.
2102201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233577895 (or 233577892 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2102201001 is about 45849.7655501094. The cubic root of 2102201001 is about 1281.0263986209.
Adding to 2102201001 its reverse (1001022012), we get a palindrome (3103223013).
The spelling of 2102201001 in words is "two billion, one hundred two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •