Base | Representation |
---|---|
bin | 11101001010110011011… |
… | …00110101001000000011 |
3 | 10112210221021220020001211 |
4 | 32211121230311020003 |
5 | 112410032432213011 |
6 | 2044230312310551 |
7 | 132260152011232 |
oct | 16453154651003 |
9 | 3483837806054 |
10 | 1002232304131 |
11 | 35705400a043 |
12 | 1422a56a2457 |
13 | 736828cab66 |
14 | 36718ad2b19 |
15 | 1b10c714b21 |
hex | e959b35203 |
1002232304131 has 2 divisors, whose sum is σ = 1002232304132. Its totient is φ = 1002232304130.
The previous prime is 1002232304113. The next prime is 1002232304167. The reversal of 1002232304131 is 1314032322001.
Together with previous prime (1002232304113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1002232304131 - 239 = 452476490243 is a prime.
It is a super-2 number, since 2×10022323041312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1002232305131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501116152065 + 501116152066.
It is an arithmetic number, because the mean of its divisors is an integer number (501116152066).
Almost surely, 21002232304131 is an apocalyptic number.
1002232304131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002232304131 is an equidigital number, since it uses as much as digits as its factorization.
1002232304131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1002232304131 its reverse (1314032322001), we get a palindrome (2316264626132).
The spelling of 1002232304131 in words is "one trillion, two billion, two hundred thirty-two million, three hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •