Base | Representation |
---|---|
bin | 10010110100011111… |
… | …10111001010010011 |
3 | 222002011112112002122 |
4 | 21122033313022103 |
5 | 131143113322011 |
6 | 4350340404455 |
7 | 505246640531 |
oct | 113217671223 |
9 | 28064475078 |
10 | 10104042131 |
11 | 4315517447 |
12 | 1b5b9a672b |
13 | c50417a71 |
14 | 6bbcc7151 |
15 | 3e20b03db |
hex | 25a3f7293 |
10104042131 has 2 divisors, whose sum is σ = 10104042132. Its totient is φ = 10104042130.
The previous prime is 10104042083. The next prime is 10104042161. The reversal of 10104042131 is 13124040101.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (13124040101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104042131 is a prime.
It is a super-2 number, since 2×101040421312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10104042161) 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, 5052021065 + 5052021066.
It is an arithmetic number, because the mean of its divisors is an integer number (5052021066).
Almost surely, 210104042131 is an apocalyptic number.
10104042131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10104042131 is an equidigital number, since it uses as much as digits as its factorization.
10104042131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10104042131 its reverse (13124040101), we get a palindrome (23228082232).
The spelling of 10104042131 in words is "ten billion, one hundred four million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •