Base | Representation |
---|---|
bin | 101010100111110… |
… | …0100000101100011 |
3 | 10200200001210211112 |
4 | 1111033210011203 |
5 | 10412104041311 |
6 | 353524533535 |
7 | 50304006041 |
oct | 12517440543 |
9 | 3620053745 |
10 | 1430143331 |
11 | 674307941 |
12 | 33ab512ab |
13 | 19a3a3a76 |
14 | d7d1b391 |
15 | 8584b28b |
hex | 553e4163 |
1430143331 has 2 divisors, whose sum is σ = 1430143332. Its totient is φ = 1430143330.
The previous prime is 1430143327. The next prime is 1430143333. The reversal of 1430143331 is 1333410341.
It is a strong prime.
It is an emirp because it is prime and its reverse (1333410341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1430143331 - 22 = 1430143327 is a prime.
It is a super-2 number, since 2×14301433312 = 4090619894407551122, which contains 22 as substring.
Together with 1430143333, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1430143297 and 1430143306.
It is not a weakly prime, because it can be changed into another prime (1430143333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 715071665 + 715071666.
It is an arithmetic number, because the mean of its divisors is an integer number (715071666).
Almost surely, 21430143331 is an apocalyptic number.
1430143331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1430143331 is an equidigital number, since it uses as much as digits as its factorization.
1430143331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 1430143331 is about 37817.2358984630. The cubic root of 1430143331 is about 1126.6608111087.
Adding to 1430143331 its reverse (1333410341), we get a palindrome (2763553672).
The spelling of 1430143331 in words is "one billion, four hundred thirty million, one hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •