Base | Representation |
---|---|
bin | 100111001011000… |
… | …0010100010110001 |
3 | 10101121021110102112 |
4 | 1032112002202301 |
5 | 10142441303213 |
6 | 334232055105 |
7 | 44400135143 |
oct | 11626024261 |
9 | 3347243375 |
10 | 1314400433 |
11 | 614a43555 |
12 | 308234495 |
13 | 17c40a748 |
14 | c67ccc93 |
15 | 7a5d6ea8 |
hex | 4e5828b1 |
1314400433 has 2 divisors, whose sum is σ = 1314400434. Its totient is φ = 1314400432.
The previous prime is 1314400397. The next prime is 1314400447. The reversal of 1314400433 is 3340044131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1058656369 + 255744064 = 32537^2 + 15992^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314400433 - 26 = 1314400369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1314400399 and 1314400408.
It is not a weakly prime, because it can be changed into another prime (1314400463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657200216 + 657200217.
It is an arithmetic number, because the mean of its divisors is an integer number (657200217).
Almost surely, 21314400433 is an apocalyptic number.
It is an amenable number.
1314400433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314400433 is an equidigital number, since it uses as much as digits as its factorization.
1314400433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 1314400433 is about 36254.6608451934. The cubic root of 1314400433 is about 1095.4079734698.
Adding to 1314400433 its reverse (3340044131), we get a palindrome (4654444564).
The spelling of 1314400433 in words is "one billion, three hundred fourteen million, four hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •