Base | Representation |
---|---|
bin | 101111100110001000… |
… | …0000110010011110101 |
3 | 100202211021001210112010 |
4 | 1133030100012103311 |
5 | 3133312010120041 |
6 | 114542144514433 |
7 | 10245612223005 |
oct | 1371420062365 |
9 | 322737053463 |
10 | 102211020021 |
11 | 3a390502180 |
12 | 1798631ba19 |
13 | 983b8cc006 |
14 | 4d3896a005 |
15 | 29d33d1a16 |
hex | 17cc4064f5 |
102211020021 has 16 divisors (see below), whose sum is σ = 148921312320. Its totient is φ = 61841598720.
The previous prime is 102211019959. The next prime is 102211020029. The reversal of 102211020021 is 120020112201.
It is not a de Polignac number, because 102211020021 - 26 = 102211019957 is a prime.
It is a super-2 number, since 2×1022110200212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102211019979 and 102211020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102211020029) 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, 2591986 + ... + 2631123.
It is an arithmetic number, because the mean of its divisors is an integer number (9307582020).
Almost surely, 2102211020021 is an apocalyptic number.
102211020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102211020021 is a deficient number, since it is larger than the sum of its proper divisors (46710292299).
102211020021 is a wasteful number, since it uses less digits than its factorization.
102211020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5223716.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102211020021 its reverse (120020112201), we get a palindrome (222231132222).
The spelling of 102211020021 in words is "one hundred two billion, two hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •