Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …011100001000011111111000 |
3 | 111101012011111000200201220011 |
4 | 113030131033130020133320 |
5 | 101332322213330202300 |
6 | 1000543130341111304 |
7 | 30326026115603446 |
oct | 2714351734103770 |
9 | 441164430621804 |
10 | 102011101022200 |
11 | 2a55a735115277 |
12 | b5365273b8534 |
13 | 44bc7b45157b6 |
14 | 1b29513b4bb96 |
15 | bbd822143eba |
hex | 5cc74f7087f8 |
102011101022200 has 48 divisors (see below), whose sum is σ = 240715747369080. Its totient is φ = 40195418904960.
The previous prime is 102011101022179. The next prime is 102011101022203. The reversal of 102011101022200 is 2220101110201.
It is a super-2 number, since 2×1020111010222002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011101022203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3806370967 + ... + 3806397766.
Almost surely, 2102011101022200 is an apocalyptic number.
102011101022200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011101022200 is an abundant number, since it is smaller than the sum of its proper divisors (138704646346880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011101022200 is a wasteful number, since it uses less digits than its factorization.
102011101022200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7612768816 (or 7612768807 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102011101022200 its reverse (2220101110201), we get a palindrome (104231202132401).
The spelling of 102011101022200 in words is "one hundred two trillion, eleven billion, one hundred one million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •