Base | Representation |
---|---|
bin | 101111100011001001… |
… | …1101100110110100111 |
3 | 100202120022102112210012 |
4 | 1133012103230312213 |
5 | 3133110443113111 |
6 | 114524223320435 |
7 | 10243261511045 |
oct | 1370623546647 |
9 | 322508375705 |
10 | 102111301031 |
11 | 3a33a192893 |
12 | 17958a5011b |
13 | 98240563ac |
14 | 4d2960d395 |
15 | 29c978548b |
hex | 17c64ecda7 |
102111301031 has 8 divisors (see below), whose sum is σ = 104313354240. Its totient is φ = 99910475928.
The previous prime is 102111301027. The next prime is 102111301067. The reversal of 102111301031 is 130103111201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102111301031 - 22 = 102111301027 is a prime.
It is a super-2 number, since 2×1021113010312 (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 = 102111300997 and 102111301015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111301231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137951 + ... + 472496.
It is an arithmetic number, because the mean of its divisors is an integer number (13039169280).
Almost surely, 2102111301031 is an apocalyptic number.
102111301031 is a deficient number, since it is larger than the sum of its proper divisors (2202053209).
102111301031 is an equidigital number, since it uses as much as digits as its factorization.
102111301031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 614053.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 102111301031 its reverse (130103111201), we get a palindrome (232214412232).
The spelling of 102111301031 in words is "one hundred two billion, one hundred eleven million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •