Base | Representation |
---|---|
bin | 101111001000101010… |
… | …0000101111000011100 |
3 | 100200021100110002200111 |
4 | 1132101110011320130 |
5 | 3124300341223400 |
6 | 114300103135404 |
7 | 10212244412113 |
oct | 1362124057034 |
9 | 320240402614 |
10 | 101222211100 |
11 | 39a2333241a |
12 | 1774b144564 |
13 | 9711aac88a |
14 | 4c834d2c7a |
15 | 29766b13ba |
hex | 1791505e1c |
101222211100 has 36 divisors (see below), whose sum is σ = 229202298864. Its totient is φ = 38728497280.
The previous prime is 101222211091. The next prime is 101222211229. The reversal of 101222211100 is 1112222101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22002529 + ... + 22007128.
It is an arithmetic number, because the mean of its divisors is an integer number (6366730524).
Almost surely, 2101222211100 is an apocalyptic number.
101222211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101222211100 is an abundant number, since it is smaller than the sum of its proper divisors (127980087764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101222211100 is a wasteful number, since it uses less digits than its factorization.
101222211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44009694 (or 44009687 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101222211100 its reverse (1112222101), we get a palindrome (102334433201).
It can be divided in two parts, 10122 and 2211100, that added together give a palindrome (2221222).
The spelling of 101222211100 in words is "one hundred one billion, two hundred twenty-two million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •