Base | Representation |
---|---|
bin | 10010101100111001… |
… | …01101101010010111 |
3 | 221220201121012101121 |
4 | 21112130231222113 |
5 | 131030304132411 |
6 | 4340142304411 |
7 | 503544106111 |
oct | 112634555227 |
9 | 27821535347 |
10 | 10040302231 |
11 | 4292541743 |
12 | 1b42588107 |
13 | c4015b74b |
14 | 6b36543b1 |
15 | 3db6be571 |
hex | 25672da97 |
10040302231 has 2 divisors, whose sum is σ = 10040302232. Its totient is φ = 10040302230.
The previous prime is 10040302229. The next prime is 10040302247. The reversal of 10040302231 is 13220304001.
It is a happy number.
It is an a-pointer prime, because the next prime (10040302247) can be obtained adding 10040302231 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10040302231 - 21 = 10040302229 is a prime.
It is a super-2 number, since 2×100403022312 (a number of 21 digits) contains 22 as substring.
Together with 10040302229, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10040302211) 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, 5020151115 + 5020151116.
It is an arithmetic number, because the mean of its divisors is an integer number (5020151116).
Almost surely, 210040302231 is an apocalyptic number.
10040302231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10040302231 is an equidigital number, since it uses as much as digits as its factorization.
10040302231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10040302231 its reverse (13220304001), we get a palindrome (23260606232).
The spelling of 10040302231 in words is "ten billion, forty million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •