Base | Representation |
---|---|
bin | 1001010010010011010010… |
… | …1011100111100011010110 |
3 | 1100011001211221000011200220 |
4 | 2110210310223213203112 |
5 | 2314240110401041042 |
6 | 33414230254215210 |
7 | 2102435561343324 |
oct | 224446453474326 |
9 | 40131757004626 |
10 | 10210021112022 |
11 | 3287055819a86 |
12 | 118a92b4b4506 |
13 | 590a54647484 |
14 | 27424c0aad14 |
15 | 12a8bd0458ec |
hex | 94934ae78d6 |
10210021112022 has 64 divisors (see below), whose sum is σ = 21538522183680. Its totient is φ = 3221621696384.
The previous prime is 10210021111987. The next prime is 10210021112059. The reversal of 10210021112022 is 22021112001201.
10210021112022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102100211120222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10210021111992 and 10210021112010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12201523 + ... + 13011425.
It is an arithmetic number, because the mean of its divisors is an integer number (336539409120).
Almost surely, 210210021112022 is an apocalyptic number.
10210021112022 is an abundant number, since it is smaller than the sum of its proper divisors (11328501071658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210021112022 is a wasteful number, since it uses less digits than its factorization.
10210021112022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 811357.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10210021112022 its reverse (22021112001201), we get a palindrome (32231133113223).
The spelling of 10210021112022 in words is "ten trillion, two hundred ten billion, twenty-one million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •