Base | Representation |
---|---|
bin | 11110100100110011010… |
… | …101010001001001010100 |
3 | 21102212022021202012201011 |
4 | 132210303111101021110 |
5 | 233411023124033022 |
6 | 4245122045342004 |
7 | 304541136130012 |
oct | 36446325211124 |
9 | 7385267665634 |
10 | 2101100221012 |
11 | 740087332251 |
12 | 29b25a267904 |
13 | 123195ca1260 |
14 | 7399daa98b2 |
15 | 399c3ae3977 |
hex | 1e933551254 |
2101100221012 has 12 divisors (see below), whose sum is σ = 3959765801236. Its totient is φ = 969738563520.
The previous prime is 2101100221009. The next prime is 2101100221013. The reversal of 2101100221012 is 2101220011012.
It can be written as a sum of positive squares in 2 ways, for example, as 839081648196 + 1262018572816 = 916014^2 + 1123396^2 .
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 = 2101100220983 and 2101100221001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101100221013) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 20202886689 + ... + 20202886792.
Almost surely, 22101100221012 is an apocalyptic number.
It is an amenable number.
2101100221012 is a deficient number, since it is larger than the sum of its proper divisors (1858665580224).
2101100221012 is a wasteful number, since it uses less digits than its factorization.
2101100221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40405773498 (or 40405773496 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2101100221012 its reverse (2101220011012), we get a palindrome (4202320232024).
The spelling of 2101100221012 in words is "two trillion, one hundred one billion, one hundred million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •