Base | Representation |
---|---|
bin | 100100000110100… |
… | …1101010100110101 |
3 | 10010102111121120200 |
4 | 1020031031110311 |
5 | 4440111001010 |
6 | 320112551113 |
7 | 42006626403 |
oct | 11015152465 |
9 | 3112447520 |
10 | 1211422005 |
11 | 5718a8312 |
12 | 299852499 |
13 | 163c93371 |
14 | b6c64473 |
15 | 71544cc0 |
hex | 4834d535 |
1211422005 has 12 divisors (see below), whose sum is σ = 2099798220. Its totient is φ = 646091712.
The previous prime is 1211421979. The next prime is 1211422019. The reversal of 1211422005 is 5002241121.
It can be written as a sum of positive squares in 2 ways, for example, as 130919364 + 1080502641 = 11442^2 + 32871^2 .
It is not a de Polignac number, because 1211422005 - 25 = 1211421973 is a prime.
It is a super-3 number, since 3×12114220053 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13460200 + ... + 13460289.
It is an arithmetic number, because the mean of its divisors is an integer number (174983185).
Almost surely, 21211422005 is an apocalyptic number.
1211422005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1211422005 is a deficient number, since it is larger than the sum of its proper divisors (888376215).
1211422005 is a wasteful number, since it uses less digits than its factorization.
1211422005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26920500 (or 26920497 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 1211422005 is about 34805.4881448314. The cubic root of 1211422005 is about 1066.0195090807.
Adding to 1211422005 its reverse (5002241121), we get a palindrome (6213663126).
The spelling of 1211422005 in words is "one billion, two hundred eleven million, four hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •