Base | Representation |
---|---|
bin | 10111011100011100111000… |
… | …110100101001110111010011 |
3 | 111112002020112102210200021212 |
4 | 113130130320310221313103 |
5 | 102003324224144432011 |
6 | 1003144104234210335 |
7 | 30501316462150361 |
oct | 2734347064516723 |
9 | 445066472720255 |
10 | 103110233202131 |
11 | 2a9438936231a1 |
12 | b6935545839ab |
13 | 456c33a58366c |
14 | 1b667c1c74631 |
15 | bdc20182308b |
hex | 5dc738d29dd3 |
103110233202131 has 2 divisors, whose sum is σ = 103110233202132. Its totient is φ = 103110233202130.
The previous prime is 103110233202127. The next prime is 103110233202149. The reversal of 103110233202131 is 131202332011301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103110233202131 - 22 = 103110233202127 is a prime.
It is a super-2 number, since 2×1031102332021312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103110233202097 and 103110233202106.
It is not a weakly prime, because it can be changed into another prime (103110233202161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555116601065 + 51555116601066.
It is an arithmetic number, because the mean of its divisors is an integer number (51555116601066).
Almost surely, 2103110233202131 is an apocalyptic number.
103110233202131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103110233202131 is an equidigital number, since it uses as much as digits as its factorization.
103110233202131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 103110233202131 its reverse (131202332011301), we get a palindrome (234312565213432).
The spelling of 103110233202131 in words is "one hundred three trillion, one hundred ten billion, two hundred thirty-three million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •