Base | Representation |
---|---|
bin | 101111101000110101… |
… | …1001101111000110111 |
3 | 100210001121021211012200 |
4 | 1133101223031320313 |
5 | 3134003303440111 |
6 | 114555155115543 |
7 | 10251065531406 |
oct | 1372153157067 |
9 | 323047254180 |
10 | 102302015031 |
11 | 3a427903067 |
12 | 179b08a2bb3 |
13 | 985470bb08 |
14 | 4d46a9563d |
15 | 29db3a8256 |
hex | 17d1acde37 |
102302015031 has 24 divisors (see below), whose sum is σ = 159168362496. Its totient is φ = 63131674320.
The previous prime is 102302015017. The next prime is 102302015033. The reversal of 102302015031 is 130510203201.
It is not a de Polignac number, because 102302015031 - 26 = 102302014967 is a prime.
It is a super-2 number, since 2×1023020150312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102302014995 and 102302015013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102302015033) 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 23 ways as a sum of consecutive naturals, for example, 7964755 + ... + 7977588.
It is an arithmetic number, because the mean of its divisors is an integer number (6632015104).
Almost surely, 2102302015031 is an apocalyptic number.
102302015031 is a deficient number, since it is larger than the sum of its proper divisors (56866347465).
102302015031 is a wasteful number, since it uses less digits than its factorization.
102302015031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15942403 (or 15942400 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 102302015031 its reverse (130510203201), we get a palindrome (232812218232).
The spelling of 102302015031 in words is "one hundred two billion, three hundred two million, fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •