Base | Representation |
---|---|
bin | 10011001000001001001… |
… | …011100100010111000001 |
3 | 11122122201202212112111222 |
4 | 103020021023210113001 |
5 | 133013404442120113 |
6 | 2443500010044425 |
7 | 163651255553402 |
oct | 23101113442701 |
9 | 4578652775458 |
10 | 1314414020033 |
11 | 4674924a1844 |
12 | 1928aa719715 |
13 | 96c4441618a |
14 | 47891a359a9 |
15 | 242ce58ae08 |
hex | 132092e45c1 |
1314414020033 has 2 divisors, whose sum is σ = 1314414020034. Its totient is φ = 1314414020032.
The previous prime is 1314414020009. The next prime is 1314414020053. The reversal of 1314414020033 is 3300204144131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 692803193104 + 621610826929 = 832348^2 + 788423^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314414020033 - 214 = 1314414003649 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1314414019984 and 1314414020011.
It is not a weakly prime, because it can be changed into another prime (1314414020053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657207010016 + 657207010017.
It is an arithmetic number, because the mean of its divisors is an integer number (657207010017).
Almost surely, 21314414020033 is an apocalyptic number.
It is an amenable number.
1314414020033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314414020033 is an equidigital number, since it uses as much as digits as its factorization.
1314414020033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1314414020033 its reverse (3300204144131), we get a palindrome (4614618164164).
The spelling of 1314414020033 in words is "one trillion, three hundred fourteen billion, four hundred fourteen million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •