Base | Representation |
---|---|
bin | 10001110001100010111… |
… | …111011101001111111111 |
3 | 11022202201122212211102100 |
4 | 101301202333131033333 |
5 | 130002442431422421 |
6 | 2333041244200143 |
7 | 154150132365324 |
oct | 21614277351777 |
9 | 4282648784370 |
10 | 1221431514111 |
11 | 431008279926 |
12 | 17887ab39053 |
13 | 8b2467262c3 |
14 | 431909a6b4b |
15 | 21b8b473c26 |
hex | 11c62fdd3ff |
1221431514111 has 12 divisors (see below), whose sum is σ = 1764402665688. Its totient is φ = 814235660304.
The previous prime is 1221431514109. The next prime is 1221431514113. The reversal of 1221431514111 is 1114151341221.
1221431514111 is a `hidden beast` number, since 1 + 2 + 2 + 1 + 4 + 31 + 514 + 111 = 666.
It is an interprime number because it is at equal distance from previous prime (1221431514109) and next prime (1221431514113).
It is not a de Polignac number, because 1221431514111 - 21 = 1221431514109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221431514113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4185660 + ... + 4467953.
It is an arithmetic number, because the mean of its divisors is an integer number (147033555474).
Almost surely, 21221431514111 is an apocalyptic number.
1221431514111 is a deficient number, since it is larger than the sum of its proper divisors (542971151577).
1221431514111 is a wasteful number, since it uses less digits than its factorization.
1221431514111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8669302 (or 8669299 counting only the distinct ones).
The product of its digits is 960, while the sum is 27.
Adding to 1221431514111 its reverse (1114151341221), we get a palindrome (2335582855332).
The spelling of 1221431514111 in words is "one trillion, two hundred twenty-one billion, four hundred thirty-one million, five hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •