Base | Representation |
---|---|
bin | 101111101001110000… |
… | …1110101011101110011 |
3 | 100210010202210121200001 |
4 | 1133103201311131303 |
5 | 3134034234011011 |
6 | 115002225410431 |
7 | 10251624040600 |
oct | 1372341653563 |
9 | 323122717601 |
10 | 102333110131 |
11 | 3a44341129a |
12 | 179bb199a17 |
13 | 985aca8395 |
14 | 4d4ac6b6a7 |
15 | 29dde9b7c1 |
hex | 17d3875773 |
102333110131 has 12 divisors (see below), whose sum is σ = 119100399672. Its totient is φ = 87669999648.
The previous prime is 102333110129. The next prime is 102333110137. The reversal of 102333110131 is 131011333201.
It is not a de Polignac number, because 102333110131 - 21 = 102333110129 is a prime.
It is a super-2 number, since 2×1023331101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102333110099 and 102333110108.
It is not an unprimeable number, because it can be changed into a prime (102333110137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 426285 + ... + 621598.
It is an arithmetic number, because the mean of its divisors is an integer number (9925033306).
Almost surely, 2102333110131 is an apocalyptic number.
102333110131 is a deficient number, since it is larger than the sum of its proper divisors (16767289541).
102333110131 is a wasteful number, since it uses less digits than its factorization.
102333110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049890 (or 1049883 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 102333110131 its reverse (131011333201), we get a palindrome (233344443332).
The spelling of 102333110131 in words is "one hundred two billion, three hundred thirty-three million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •