Base | Representation |
---|---|
bin | 100100000110001… |
… | …1001110111000001 |
3 | 10010102002220102010 |
4 | 1020030121313001 |
5 | 4440032224301 |
6 | 320104243133 |
7 | 42005060664 |
oct | 11014316701 |
9 | 3112086363 |
10 | 1211211201 |
11 | 5717739a2 |
12 | 2997704a9 |
13 | 163c1b425 |
14 | b6c0b6db |
15 | 715025d6 |
hex | 48319dc1 |
1211211201 has 8 divisors (see below), whose sum is σ = 1619350144. Its totient is φ = 805273200.
The previous prime is 1211211077. The next prime is 1211211203. The reversal of 1211211201 is 1021121121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1211211201 - 210 = 1211210177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1211211203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 548950 + ... + 551151.
It is an arithmetic number, because the mean of its divisors is an integer number (202418768).
Almost surely, 21211211201 is an apocalyptic number.
It is an amenable number.
1211211201 is a deficient number, since it is larger than the sum of its proper divisors (408138943).
1211211201 is a wasteful number, since it uses less digits than its factorization.
1211211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100471.
The product of its (nonzero) digits is 8, while the sum is 12.
The square root of 1211211201 is about 34802.4596975559. The cubic root of 1211211201 is about 1065.9576715015.
Adding to 1211211201 its reverse (1021121121), we get a palindrome (2232332322).
It can be divided in two parts, 121121120 and 1, that added together give a palindrome (121121121).
The spelling of 1211211201 in words is "one billion, two hundred eleven million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •