Base | Representation |
---|---|
bin | 101111011111111111… |
… | …1000111100100000001 |
3 | 100202021220212012022010 |
4 | 1132333333013210001 |
5 | 3132401320221423 |
6 | 114505514203133 |
7 | 10240533152265 |
oct | 1367777074401 |
9 | 322256765263 |
10 | 102005242113 |
11 | 3a295333195 |
12 | 179294234a9 |
13 | 98080a0b38 |
14 | 4d194c20a5 |
15 | 29c02d5693 |
hex | 17bffc7901 |
102005242113 has 8 divisors (see below), whose sum is σ = 136377582208. Its totient is φ = 67818198384.
The previous prime is 102005242043. The next prime is 102005242117. The reversal of 102005242113 is 311242500201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102005242113 - 220 = 102004193537 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102005242113.
It is not an unprimeable number, because it can be changed into a prime (102005242117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46322806 + ... + 46325007.
It is an arithmetic number, because the mean of its divisors is an integer number (17047197776).
Almost surely, 2102005242113 is an apocalyptic number.
It is an amenable number.
102005242113 is a deficient number, since it is larger than the sum of its proper divisors (34372340095).
102005242113 is an equidigital number, since it uses as much as digits as its factorization.
102005242113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92648183.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 102005242113 its reverse (311242500201), we get a palindrome (413247742314).
The spelling of 102005242113 in words is "one hundred two billion, five million, two hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •