Base | Representation |
---|---|
bin | 11110100101101001101… |
… | …011110110100101110101 |
3 | 21102221122211122000220121 |
4 | 132211221223312211311 |
5 | 233414410100024341 |
6 | 4245352342331541 |
7 | 304602551100031 |
oct | 36455153664565 |
9 | 7387584560817 |
10 | 2102012111221 |
11 | 740505045920 |
12 | 29b473729bb1 |
13 | 1232acb9b969 |
14 | 73a48c3d1c1 |
15 | 39a28bbd4d1 |
hex | 1e969af6975 |
2102012111221 has 16 divisors (see below), whose sum is σ = 2412383083200. Its totient is φ = 1813754656000.
The previous prime is 2102012111219. The next prime is 2102012111257. The reversal of 2102012111221 is 1221112102012.
It is not a de Polignac number, because 2102012111221 - 21 = 2102012111219 is a prime.
It is a super-2 number, since 2×21020121112212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102012111195 and 2102012111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102012111821) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55823380 + ... + 55861021.
It is an arithmetic number, because the mean of its divisors is an integer number (150773942700).
Almost surely, 22102012111221 is an apocalyptic number.
It is an amenable number.
2102012111221 is a deficient number, since it is larger than the sum of its proper divisors (310370971979).
2102012111221 is a wasteful number, since it uses less digits than its factorization.
2102012111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111684500.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2102012111221 its reverse (1221112102012), we get a palindrome (3323124213233).
The spelling of 2102012111221 in words is "two trillion, one hundred two billion, twelve million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •