Base | Representation |
---|---|
bin | 101111100011110000… |
… | …0000010100111001111 |
3 | 100202121201002021012001 |
4 | 1133013200002213033 |
5 | 3133131104004403 |
6 | 114530220253131 |
7 | 10243623560221 |
oct | 1370740024717 |
9 | 322551067161 |
10 | 102131313103 |
11 | 3a34a511196 |
12 | 179636a11a7 |
13 | 9828242161 |
14 | 4d2c13c411 |
15 | 29cb3d9c1d |
hex | 17c78029cf |
102131313103 has 8 divisors (see below), whose sum is σ = 102745794528. Its totient is φ = 101517109344.
The previous prime is 102131313091. The next prime is 102131313139. The reversal of 102131313103 is 301313131201.
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 102131313103 - 213 = 102131304911 is a prime.
It is a super-2 number, since 2×1021313131032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102131316103) 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 7 ways as a sum of consecutive naturals, for example, 693550 + ... + 827812.
It is an arithmetic number, because the mean of its divisors is an integer number (12843224316).
Almost surely, 2102131313103 is an apocalyptic number.
102131313103 is a deficient number, since it is larger than the sum of its proper divisors (614481425).
102131313103 is a wasteful number, since it uses less digits than its factorization.
102131313103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138833.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 102131313103 its reverse (301313131201), we get a palindrome (403444444304).
The spelling of 102131313103 in words is "one hundred two billion, one hundred thirty-one million, three hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •