Base | Representation |
---|---|
bin | 10010110101101110… |
… | …11011001001001011 |
3 | 222002220001102102202 |
4 | 21122313123021023 |
5 | 131203242210011 |
6 | 4351350550415 |
7 | 505434043634 |
oct | 113267331113 |
9 | 28086042382 |
10 | 10114413131 |
11 | 4320360319 |
12 | 1b6336840b |
13 | c52609454 |
14 | 6bd42688b |
15 | 3e2e5d23b |
hex | 25addb24b |
10114413131 has 2 divisors, whose sum is σ = 10114413132. Its totient is φ = 10114413130.
The previous prime is 10114413103. The next prime is 10114413151. The reversal of 10114413131 is 13131441101.
It is an a-pointer prime, because the next prime (10114413151) can be obtained adding 10114413131 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10114413131 - 222 = 10110218827 is a prime.
It is a super-2 number, since 2×101144131312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10114413151) 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, 5057206565 + 5057206566.
It is an arithmetic number, because the mean of its divisors is an integer number (5057206566).
Almost surely, 210114413131 is an apocalyptic number.
10114413131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114413131 is an equidigital number, since it uses as much as digits as its factorization.
10114413131 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 20.
Adding to 10114413131 its reverse (13131441101), we get a palindrome (23245854232).
The spelling of 10114413131 in words is "ten billion, one hundred fourteen million, four hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •