Base | Representation |
---|---|
bin | 10100100101010010101… |
… | …000011000000011110001 |
3 | 12000012220002122000101202 |
4 | 110211102220120003301 |
5 | 141133223210301101 |
6 | 3001440323340545 |
7 | 204121623234032 |
oct | 24452250300361 |
9 | 5005802560352 |
10 | 1414430556401 |
11 | 4a59471a1965 |
12 | 1aa161b21755 |
13 | a34c3495645 |
14 | 4c65cd5ca89 |
15 | 26bd4e9036b |
hex | 14952a180f1 |
1414430556401 has 2 divisors, whose sum is σ = 1414430556402. Its totient is φ = 1414430556400.
The previous prime is 1414430556377. The next prime is 1414430556403. The reversal of 1414430556401 is 1046550344141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1070593743025 + 343836813376 = 1034695^2 + 586376^2 .
It is an emirp because it is prime and its reverse (1046550344141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1414430556401 - 26 = 1414430556337 is a prime.
It is a super-2 number, since 2×14144305564012 (a number of 25 digits) contains 22 as substring.
Together with 1414430556403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1414430556403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 707215278200 + 707215278201.
It is an arithmetic number, because the mean of its divisors is an integer number (707215278201).
Almost surely, 21414430556401 is an apocalyptic number.
It is an amenable number.
1414430556401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1414430556401 is an equidigital number, since it uses as much as digits as its factorization.
1414430556401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 1414430556401 in words is "one trillion, four hundred fourteen billion, four hundred thirty million, five hundred fifty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •