Base | Representation |
---|---|
bin | 10011000111110001001… |
… | …111100000100111000101 |
3 | 11122121200210011010111111 |
4 | 103013301033200213011 |
5 | 133012044133300234 |
6 | 2443352102005021 |
7 | 163635311053615 |
oct | 23076117404705 |
9 | 4577623133444 |
10 | 1314012400069 |
11 | 4672a681a816 |
12 | 1927b8116771 |
13 | 96bac158425 |
14 | 4785456ca45 |
15 | 242a91a7664 |
hex | 131f13e09c5 |
1314012400069 has 2 divisors, whose sum is σ = 1314012400070. Its totient is φ = 1314012400068.
The previous prime is 1314012400067. The next prime is 1314012400157. The reversal of 1314012400069 is 9600042104131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1304552308900 + 9460091169 = 1142170^2 + 97263^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314012400069 - 21 = 1314012400067 is a prime.
It is a super-2 number, since 2×13140124000692 (a number of 25 digits) contains 22 as substring.
Together with 1314012400067, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1314012400069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314012400067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657006200034 + 657006200035.
It is an arithmetic number, because the mean of its divisors is an integer number (657006200035).
Almost surely, 21314012400069 is an apocalyptic number.
It is an amenable number.
1314012400069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314012400069 is an equidigital number, since it uses as much as digits as its factorization.
1314012400069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 1314012400069 in words is "one trillion, three hundred fourteen billion, twelve million, four hundred thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •