Base | Representation |
---|---|
bin | 10100011010000000110… |
… | …111001111001100111011 |
3 | 11222001122011221011122021 |
4 | 110122000313033030323 |
5 | 140433423223133311 |
6 | 2552114552135311 |
7 | 203212554253225 |
oct | 24320067171473 |
9 | 4861564834567 |
10 | 1402321302331 |
11 | 4a07a28a9074 |
12 | 1a7942697537 |
13 | a23137ca151 |
14 | 4bc30a21415 |
15 | 26726d3d171 |
hex | 14680dcf33b |
1402321302331 has 2 divisors, whose sum is σ = 1402321302332. Its totient is φ = 1402321302330.
The previous prime is 1402321302311. The next prime is 1402321302337. The reversal of 1402321302331 is 1332031232041.
It is a strong prime.
It is an emirp because it is prime and its reverse (1332031232041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1402321302331 - 27 = 1402321302203 is a prime.
It is a super-2 number, since 2×14023213023312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1402321302296 and 1402321302305.
It is not a weakly prime, because it can be changed into another prime (1402321302337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 701160651165 + 701160651166.
It is an arithmetic number, because the mean of its divisors is an integer number (701160651166).
Almost surely, 21402321302331 is an apocalyptic number.
1402321302331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402321302331 is an equidigital number, since it uses as much as digits as its factorization.
1402321302331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1402321302331 its reverse (1332031232041), we get a palindrome (2734352534372).
The spelling of 1402321302331 in words is "one trillion, four hundred two billion, three hundred twenty-one million, three hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •