Base | Representation |
---|---|
bin | 1001000110011011101001… |
… | …01111000000010011001000 |
3 | 2121212011000101211020000021 |
4 | 10203031310233000103020 |
5 | 10110340002021023422 |
6 | 110321252144350224 |
7 | 4133556150530623 |
oct | 443156457002310 |
9 | 77764011736007 |
10 | 20012211111112 |
11 | 6416149500600 |
12 | 22b2601015374 |
13 | b221b30c307c |
14 | 4d284bd10dba |
15 | 24a86be07dc7 |
hex | 123374bc04c8 |
20012211111112 has 24 divisors (see below), whose sum is σ = 41244174760950. Its totient is φ = 9096459595520.
The previous prime is 20012211111097. The next prime is 20012211111161. The reversal of 20012211111112 is 21111111221002.
It can be written as a sum of positive squares in only one way, i.e., 16695346968036 + 3316864143076 = 4085994^2 + 1821226^2 .
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 5 ways as a sum of consecutive naturals, for example, 10336884937 + ... + 10336886872.
Almost surely, 220012211111112 is an apocalyptic number.
20012211111112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20012211111112 is an abundant number, since it is smaller than the sum of its proper divisors (21231963649838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20012211111112 is a wasteful number, since it uses less digits than its factorization.
20012211111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20673771837 (or 20673771822 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 20012211111112 its reverse (21111111221002), we get a palindrome (41123322332114).
The spelling of 20012211111112 in words is "twenty trillion, twelve billion, two hundred eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •