Base | Representation |
---|---|
bin | 10100100011111111111… |
… | …100000010100010110111 |
3 | 12000002022102002010020222 |
4 | 110203333330002202313 |
5 | 141122403024432411 |
6 | 3001050523444555 |
7 | 204042346020503 |
oct | 24437774024267 |
9 | 5002272063228 |
10 | 1413043202231 |
11 | 4a52a5060171 |
12 | 1a9a3538675b |
13 | a3331c23b0b |
14 | 4c56a9bd303 |
15 | 26b532974db |
hex | 148fff028b7 |
1413043202231 has 2 divisors, whose sum is σ = 1413043202232. Its totient is φ = 1413043202230.
The previous prime is 1413043202189. The next prime is 1413043202267. The reversal of 1413043202231 is 1322023403141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1413043202231 - 26 = 1413043202167 is a prime.
It is a super-2 number, since 2×14130432022312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1413043202231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413043202281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706521601115 + 706521601116.
It is an arithmetic number, because the mean of its divisors is an integer number (706521601116).
Almost surely, 21413043202231 is an apocalyptic number.
1413043202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413043202231 is an equidigital number, since it uses as much as digits as its factorization.
1413043202231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1413043202231 its reverse (1322023403141), we get a palindrome (2735066605372).
The spelling of 1413043202231 in words is "one trillion, four hundred thirteen billion, forty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •