Base | Representation |
---|---|
bin | 11110100011110001110… |
… | …100110101011110010110 |
3 | 21102202110200202011100001 |
4 | 132203301310311132112 |
5 | 233401300301400042 |
6 | 4244421025441514 |
7 | 304501662452125 |
oct | 36436164653626 |
9 | 7382420664301 |
10 | 2100001200022 |
11 | 73a672a26540 |
12 | 29abb21a029a |
13 | 12304c3a408b |
14 | 738d7b43abc |
15 | 3995c3a2bb7 |
hex | 1e8f1d35796 |
2100001200022 has 8 divisors (see below), whose sum is σ = 3436365600072. Its totient is φ = 954546000000.
The previous prime is 2100001200019. The next prime is 2100001200029. The reversal of 2100001200022 is 2200021000012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×21000012000224 (a number of 50 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2100001199981 and 2100001200008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100001200029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47727299979 + ... + 47727300022.
It is an arithmetic number, because the mean of its divisors is an integer number (429545700009).
Almost surely, 22100001200022 is an apocalyptic number.
2100001200022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2100001200022 is a deficient number, since it is larger than the sum of its proper divisors (1336364400050).
2100001200022 is a wasteful number, since it uses less digits than its factorization.
2100001200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95454600014.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2100001200022 its reverse (2200021000012), we get a palindrome (4300022200034).
The spelling of 2100001200022 in words is "two trillion, one hundred billion, one million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •