Base | Representation |
---|---|
bin | 1000001110111100… |
… | …1111111001110001 |
3 | 12201000212212001202 |
4 | 2003233033321301 |
5 | 14011302414301 |
6 | 1003152140545 |
7 | 105525254165 |
oct | 20357177161 |
9 | 5630785052 |
10 | 2210201201 |
11 | a3466796a |
12 | 518237755 |
13 | 292b93980 |
14 | 16d774ca5 |
15 | ce08466b |
hex | 83bcfe71 |
2210201201 has 12 divisors (see below), whose sum is σ = 2512089972. Its totient is φ = 1932803424.
The previous prime is 2210201173. The next prime is 2210201207. The reversal of 2210201201 is 1021020122.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1473024400 + 737176801 = 38380^2 + 27151^2 .
It is not a de Polignac number, because 2210201201 - 222 = 2206006897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2210201207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 230786 + ... + 240171.
It is an arithmetic number, because the mean of its divisors is an integer number (209340831).
Almost surely, 22210201201 is an apocalyptic number.
It is an amenable number.
2210201201 is a deficient number, since it is larger than the sum of its proper divisors (301888771).
2210201201 is a wasteful number, since it uses less digits than its factorization.
2210201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471008 (or 470989 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2210201201 is about 47012.7769973228. The cubic root of 2210201201 is about 1302.5985893595.
Adding to 2210201201 its reverse (1021020122), we get a palindrome (3231221323).
The spelling of 2210201201 in words is "two billion, two hundred ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •