Base | Representation |
---|---|
bin | 10001101010101001111… |
… | …001001011001011111001 |
3 | 11022001121220201121022102 |
4 | 101222221321023023321 |
5 | 124342313431140001 |
6 | 2325415044033145 |
7 | 153465552132605 |
oct | 21525171131371 |
9 | 4261556647272 |
10 | 1214031115001 |
11 | 42895aa07501 |
12 | 1773546927b5 |
13 | 8a63749c213 |
14 | 42a8bbc0505 |
15 | 218a6917e6b |
hex | 11aa9e4b2f9 |
1214031115001 has 2 divisors, whose sum is σ = 1214031115002. Its totient is φ = 1214031115000.
The previous prime is 1214031114991. The next prime is 1214031115021. The reversal of 1214031115001 is 1005111304121.
It is an a-pointer prime, because the next prime (1214031115021) can be obtained adding 1214031115001 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1082172075625 + 131859039376 = 1040275^2 + 363124^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214031115001 - 214 = 1214031098617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1214031115021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 607015557500 + 607015557501.
It is an arithmetic number, because the mean of its divisors is an integer number (607015557501).
Almost surely, 21214031115001 is an apocalyptic number.
It is an amenable number.
1214031115001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214031115001 is an equidigital number, since it uses as much as digits as its factorization.
1214031115001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 1214031115001 its reverse (1005111304121), we get a palindrome (2219142419122).
The spelling of 1214031115001 in words is "one trillion, two hundred fourteen billion, thirty-one million, one hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •