Base | Representation |
---|---|
bin | 101111100011001001… |
… | …1110000010010000011 |
3 | 100202120022110021001100 |
4 | 1133012103300102003 |
5 | 3133110444040300 |
6 | 114524223505443 |
7 | 10243261600020 |
oct | 1370623602203 |
9 | 322508407040 |
10 | 102111315075 |
11 | 3a33a1a23a0 |
12 | 17958a58283 |
13 | 982405c8c3 |
14 | 4d29614547 |
15 | 29c9789700 |
hex | 17c64f0483 |
102111315075 has 72 divisors (see below), whose sum is σ = 228022119936. Its totient is φ = 42435864000.
The previous prime is 102111315049. The next prime is 102111315143. The reversal of 102111315075 is 570513111201.
102111315075 is a `hidden beast` number, since 1 + 0 + 21 + 1 + 131 + 507 + 5 = 666.
It is not a de Polignac number, because 102111315075 - 28 = 102111314819 is a prime.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 2929611 + ... + 2964260.
It is an arithmetic number, because the mean of its divisors is an integer number (3166973888).
Almost surely, 2102111315075 is an apocalyptic number.
102111315075 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102111315075 is an abundant number, since it is smaller than the sum of its proper divisors (125910804861).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111315075 is a wasteful number, since it uses less digits than its factorization.
102111315075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5893905 (or 5893897 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 27.
Adding to 102111315075 its reverse (570513111201), we get a palindrome (672624426276).
The spelling of 102111315075 in words is "one hundred two billion, one hundred eleven million, three hundred fifteen thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •