Base | Representation |
---|---|
bin | 10011001000001000010… |
… | …110011111100000100011 |
3 | 11122122200210200122210002 |
4 | 103020020112133200203 |
5 | 133013342411402111 |
6 | 2443454351530215 |
7 | 163651026364301 |
oct | 23101026374043 |
9 | 4578623618702 |
10 | 1314400106531 |
11 | 467485659386 |
12 | 1928a5b2996b |
13 | 96c41584235 |
14 | 4788dc53271 |
15 | 242cd23d63b |
hex | 1320859f823 |
1314400106531 has 2 divisors, whose sum is σ = 1314400106532. Its totient is φ = 1314400106530.
The previous prime is 1314400106527. The next prime is 1314400106597. The reversal of 1314400106531 is 1356010044131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1314400106531 - 22 = 1314400106527 is a prime.
It is a super-2 number, since 2×13144001065312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1314400106494 and 1314400106503.
It is not a weakly prime, because it can be changed into another prime (1314400106231) 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, 657200053265 + 657200053266.
It is an arithmetic number, because the mean of its divisors is an integer number (657200053266).
Almost surely, 21314400106531 is an apocalyptic number.
1314400106531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314400106531 is an equidigital number, since it uses as much as digits as its factorization.
1314400106531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
The spelling of 1314400106531 in words is "one trillion, three hundred fourteen billion, four hundred million, one hundred six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •