Base | Representation |
---|---|
bin | 11101011011001110100… |
… | …011101110011111111000 |
3 | 21011022101122002022100111 |
4 | 131123032203232133320 |
5 | 231112230111213422 |
6 | 4144535010514104 |
7 | 266043345156520 |
oct | 35331643563770 |
9 | 7138348068314 |
10 | 2022100101112 |
11 | 70a627877963 |
12 | 287a91295934 |
13 | 1188b6063b90 |
14 | 6dc27a4a680 |
15 | 378ed2d0a77 |
hex | 1d6ce8ee7f8 |
2022100101112 has 32 divisors (see below), whose sum is σ = 4666384850400. Its totient is φ = 799951688064.
The previous prime is 2022100101079. The next prime is 2022100101167. The reversal of 2022100101112 is 2111010012202.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2022100101092 and 2022100101101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1388804287 + ... + 1388805742.
It is an arithmetic number, because the mean of its divisors is an integer number (145824526575).
Almost surely, 22022100101112 is an apocalyptic number.
It is an amenable number.
2022100101112 is an abundant number, since it is smaller than the sum of its proper divisors (2644284749288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022100101112 is a wasteful number, since it uses less digits than its factorization.
2022100101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2777610055 (or 2777610051 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2022100101112 its reverse (2111010012202), we get a palindrome (4133110113314).
It can be divided in two parts, 2022100 and 101112, that added together give a palindrome (2123212).
The spelling of 2022100101112 in words is "two trillion, twenty-two billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •