Base | Representation |
---|---|
bin | 10111001111001110001101… |
… | …100000110111010110011110 |
3 | 111101212022221211211022212220 |
4 | 113033032031200313112132 |
5 | 101343430343434323402 |
6 | 1001210314041010210 |
7 | 30345534024060261 |
oct | 2717161540672636 |
9 | 441768854738786 |
10 | 102201121011102 |
11 | 2a623285484413 |
12 | b567318783966 |
13 | 45046a8025859 |
14 | 1b347bc5d0cd8 |
15 | bc3744357dbc |
hex | 5cf38d83759e |
102201121011102 has 8 divisors (see below), whose sum is σ = 204402242022216. Its totient is φ = 34067040337032.
The previous prime is 102201121011091. The next prime is 102201121011113. The reversal of 102201121011102 is 201110121102201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102201121011091) and next prime (102201121011113).
It is a sphenic number, since it is the product of 3 distinct primes.
102201121011102 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8516760084253 + ... + 8516760084264.
It is an arithmetic number, because the mean of its divisors is an integer number (25550280252777).
Almost surely, 2102201121011102 is an apocalyptic number.
102201121011102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102201121011102 is a wasteful number, since it uses less digits than its factorization.
102201121011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17033520168522.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102201121011102 its reverse (201110121102201), we get a palindrome (303311242113303).
The spelling of 102201121011102 in words is "one hundred two trillion, two hundred one billion, one hundred twenty-one million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •