Base | Representation |
---|---|
bin | 10001101011000111000… |
… | …010001000101101001001 |
3 | 11022002212222122201010012 |
4 | 101223013002020231021 |
5 | 124344314110102101 |
6 | 2325535350401305 |
7 | 153513636460325 |
oct | 21530702105511 |
9 | 4262788581105 |
10 | 1214520003401 |
11 | 429090974601 |
12 | 177470360235 |
13 | 8a6b48637b3 |
14 | 42ad6ac2985 |
15 | 218d47d8bbb |
hex | 11ac7088b49 |
1214520003401 has 2 divisors, whose sum is σ = 1214520003402. Its totient is φ = 1214520003400.
The previous prime is 1214520003383. The next prime is 1214520003479. The reversal of 1214520003401 is 1043000254121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 919535237776 + 294984765625 = 958924^2 + 543125^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1214520003401 is a prime.
It is a super-2 number, since 2×12145200034012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1214520003001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 607260001700 + 607260001701.
It is an arithmetic number, because the mean of its divisors is an integer number (607260001701).
Almost surely, 21214520003401 is an apocalyptic number.
It is an amenable number.
1214520003401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214520003401 is an equidigital number, since it uses as much as digits as its factorization.
1214520003401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 1214520003401 its reverse (1043000254121), we get a palindrome (2257520257522).
The spelling of 1214520003401 in words is "one trillion, two hundred fourteen billion, five hundred twenty million, three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •