Base | Representation |
---|---|
bin | 11110100101101010010… |
… | …001100101000101111101 |
3 | 21102221200112020111011111 |
4 | 132211222101211011331 |
5 | 233414420113013041 |
6 | 4245353334322021 |
7 | 304603031130205 |
oct | 36455221450575 |
9 | 7387615214144 |
10 | 2102022001021 |
11 | 74050a690208 |
12 | 29b476ab9311 |
13 | 1232b1c52307 |
14 | 73a4a295405 |
15 | 39a299c3981 |
hex | 1e96a46517d |
2102022001021 has 16 divisors (see below), whose sum is σ = 2174841961600. Its totient is φ = 2030051066688.
The previous prime is 2102022000971. The next prime is 2102022001099. The reversal of 2102022001021 is 1201002202012.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2102022001021 - 27 = 2102022000893 is a prime.
It is a super-3 number, since 3×21020220010213 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102022000992 and 2102022001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102022002021) 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, 24710800 + ... + 24795718.
It is an arithmetic number, because the mean of its divisors is an integer number (135927622600).
Almost surely, 22102022001021 is an apocalyptic number.
It is an amenable number.
2102022001021 is a deficient number, since it is larger than the sum of its proper divisors (72819960579).
2102022001021 is a wasteful number, since it uses less digits than its factorization.
2102022001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89908.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2102022001021 its reverse (1201002202012), we get a palindrome (3303024203033).
The spelling of 2102022001021 in words is "two trillion, one hundred two billion, twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •