Base | Representation |
---|---|
bin | 101111100011101110… |
… | …0010000001100000011 |
3 | 100202121122012211002022 |
4 | 1133013130100030003 |
5 | 3133130330221011 |
6 | 114530143112055 |
7 | 10243612253240 |
oct | 1370734201403 |
9 | 322548184068 |
10 | 102130320131 |
11 | 3a3499a3154 |
12 | 179632a262b |
13 | 9827c851b8 |
14 | 4d2bd605c7 |
15 | 29cb2908db |
hex | 17c7710303 |
102130320131 has 8 divisors (see below), whose sum is σ = 116949683040. Its totient is φ = 87368286528.
The previous prime is 102130320119. The next prime is 102130320139. The reversal of 102130320131 is 131023031201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102130320131 is a prime.
It is a super-2 number, since 2×1021303201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102130320139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14328506 + ... + 14335631.
It is an arithmetic number, because the mean of its divisors is an integer number (14618710380).
Almost surely, 2102130320131 is an apocalyptic number.
102130320131 is a deficient number, since it is larger than the sum of its proper divisors (14819362909).
102130320131 is an equidigital number, since it uses as much as digits as its factorization.
102130320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28664653.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 102130320131 its reverse (131023031201), we get a palindrome (233153351332).
The spelling of 102130320131 in words is "one hundred two billion, one hundred thirty million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •