Base | Representation |
---|---|
bin | 101111100100000010… |
… | …1111000001111110001 |
3 | 100202122101202012111210 |
4 | 1133020011320033301 |
5 | 3133141123411423 |
6 | 114531213030333 |
7 | 10244104101504 |
oct | 1371005701761 |
9 | 322571665453 |
10 | 102141232113 |
11 | 3a355076518 |
12 | 17966a853a9 |
13 | 982a305bab |
14 | 4d2d5a113b |
15 | 29cc1e8b93 |
hex | 17c81783f1 |
102141232113 has 48 divisors (see below), whose sum is σ = 142149095424. Its totient is φ = 65223617760.
The previous prime is 102141232093. The next prime is 102141232177. The reversal of 102141232113 is 311232141201.
It is not a de Polignac number, because 102141232113 - 210 = 102141231089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102141232113.
It is not an unprimeable number, because it can be changed into a prime (102141232313) 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 47 ways as a sum of consecutive naturals, for example, 87825070 + ... + 87826232.
It is an arithmetic number, because the mean of its divisors is an integer number (2961439488).
Almost surely, 2102141232113 is an apocalyptic number.
It is an amenable number.
102141232113 is a deficient number, since it is larger than the sum of its proper divisors (40007863311).
102141232113 is a wasteful number, since it uses less digits than its factorization.
102141232113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546 (or 1503 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 102141232113 its reverse (311232141201), we get a palindrome (413373373314).
The spelling of 102141232113 in words is "one hundred two billion, one hundred forty-one million, two hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •