Base | Representation |
---|---|
bin | 101111100100000001… |
… | …0010101011010110111 |
3 | 100202122100000000001100 |
4 | 1133020002111122313 |
5 | 3133140404144111 |
6 | 114531141101143 |
7 | 10244063152014 |
oct | 1371002253267 |
9 | 322570000040 |
10 | 102140303031 |
11 | 3a3545a1488 |
12 | 179666b77b3 |
13 | 982a06c040 |
14 | 4d2d3dc70b |
15 | 29cc0b3756 |
hex | 17c80956b7 |
102140303031 has 24 divisors (see below), whose sum is σ = 160290997776. Its totient is φ = 62299319040.
The previous prime is 102140303021. The next prime is 102140303033. The reversal of 102140303031 is 130303041201.
It is not a de Polignac number, because 102140303031 - 27 = 102140302903 is a prime.
It is a super-2 number, since 2×1021403030312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102140302995 and 102140303013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102140303033) 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 in 23 ways as a sum of consecutive naturals, for example, 3849585 + ... + 3876026.
It is an arithmetic number, because the mean of its divisors is an integer number (6678791574).
Almost surely, 2102140303031 is an apocalyptic number.
102140303031 is a deficient number, since it is larger than the sum of its proper divisors (58150694745).
102140303031 is a wasteful number, since it uses less digits than its factorization.
102140303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7725743 (or 7725740 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 102140303031 its reverse (130303041201), we get a palindrome (232443344232).
The spelling of 102140303031 in words is "one hundred two billion, one hundred forty million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •