Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000101000110110101100000 |
3 | 111101012011020202111012211022 |
4 | 113030131022011012311200 |
5 | 101332322022320200000 |
6 | 1000543113405505012 |
7 | 30326023644353552 |
oct | 2714351205066540 |
9 | 441164222435738 |
10 | 102011011100000 |
11 | 2a55a699387402 |
12 | b536501272168 |
13 | 44bc79b9c00b2 |
14 | 1b29505c214d2 |
15 | bbd8192d0585 |
hex | 5cc74a146d60 |
102011011100000 has 72 divisors (see below), whose sum is σ = 251026656140736. Its totient is φ = 40804404400000.
The previous prime is 102011011099973. The next prime is 102011011100017. The reversal of 102011011100000 is 1110110201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 509955056 + ... + 510155055.
It is an arithmetic number, because the mean of its divisors is an integer number (3486481335288).
Almost surely, 2102011011100000 is an apocalyptic number.
102011011100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011011100000 is an abundant number, since it is smaller than the sum of its proper divisors (149015645040736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011011100000 is an frugal number, since it uses more digits than its factorization.
102011011100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020110146 (or 1020110118 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 102011011100000 its reverse (1110110201), we get a palindrome (102012121210201).
The spelling of 102011011100000 in words is "one hundred two trillion, eleven billion, eleven million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •