Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …000000110100100111101000 |
3 | 112102110220111020201122011011 |
4 | 121000231211000310213220 |
5 | 103404220202121212300 |
6 | 1025541203240513304 |
7 | 32112150034602220 |
oct | 3100554500644750 |
9 | 472426436648134 |
10 | 110000102132200 |
11 | 3205a865a58675 |
12 | 1040690b77b834 |
13 | 494bc714b0607 |
14 | 1d24067729080 |
15 | cab54d688eba |
hex | 640b650349e8 |
110000102132200 has 48 divisors (see below), whose sum is σ = 292285985669280. Its totient is φ = 37714320730560.
The previous prime is 110000102132189. The next prime is 110000102132273. The reversal of 110000102132200 is 2231201000011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39285749362 + ... + 39285752161.
It is an arithmetic number, because the mean of its divisors is an integer number (6089291368110).
Almost surely, 2110000102132200 is an apocalyptic number.
110000102132200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110000102132200 is an abundant number, since it is smaller than the sum of its proper divisors (182285883537080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000102132200 is a wasteful number, since it uses less digits than its factorization.
110000102132200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78571501546 (or 78571501537 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110000102132200 its reverse (2231201000011), we get a palindrome (112231303132211).
The spelling of 110000102132200 in words is "one hundred ten trillion, one hundred two million, one hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •