Base | Representation |
---|---|
bin | 10110110010011011000001… |
… | …111110010001001111011100 |
3 | 111010212010112222101122102020 |
4 | 112302123001332101033130 |
5 | 101114014144412223400 |
6 | 553053205543500140 |
7 | 30052542054250005 |
oct | 2662330176211734 |
9 | 433763488348366 |
10 | 100222021211100 |
11 | 29a2aa14211198 |
12 | b2a7848157650 |
13 | 43bcb85802839 |
14 | 1aa6ab37d61ac |
15 | b8c0111622a0 |
hex | 5b26c1f913dc |
100222021211100 has 72 divisors (see below), whose sum is σ = 299974877306160. Its totient is φ = 25804290516480.
The previous prime is 100222021211041. The next prime is 100222021211189. The reversal of 100222021211100 is 1112120222001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 100222021211100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5759877577 + ... + 5759894976.
Almost surely, 2100222021211100 is an apocalyptic number.
100222021211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100222021211100 is an abundant number, since it is smaller than the sum of its proper divisors (199752856095060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222021211100 is a wasteful number, since it uses less digits than its factorization.
100222021211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11519772599 (or 11519772592 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100222021211100 its reverse (1112120222001), we get a palindrome (101334141433101).
The spelling of 100222021211100 in words is "one hundred trillion, two hundred twenty-two billion, twenty-one million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •