Base | Representation |
---|---|
bin | 1001010001110001101110… |
… | …0101110000110010110110 |
3 | 1100010012120221102000200212 |
4 | 2110130123211300302312 |
5 | 2314113132103241042 |
6 | 33410140203305422 |
7 | 2101666354064000 |
oct | 224343345606266 |
9 | 40105527360625 |
10 | 10201010212022 |
11 | 3283251363493 |
12 | 118903581b272 |
13 | 58cc4984ba96 |
14 | 273a35459370 |
15 | 12a541e14482 |
hex | 9471b970cb6 |
10201010212022 has 64 divisors (see below), whose sum is σ = 18071852198400. Its totient is φ = 4316458255200.
The previous prime is 10201010212021. The next prime is 10201010212031. The reversal of 10201010212022 is 22021201010201.
10201010212022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 10201010211988 and 10201010212006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201010212021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17415497 + ... + 17991707.
It is an arithmetic number, because the mean of its divisors is an integer number (282372690600).
Almost surely, 210201010212022 is an apocalyptic number.
10201010212022 is a deficient number, since it is larger than the sum of its proper divisors (7870841986378).
10201010212022 is a wasteful number, since it uses less digits than its factorization.
10201010212022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576562 (or 576548 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10201010212022 its reverse (22021201010201), we get a palindrome (32222211222223).
The spelling of 10201010212022 in words is "ten trillion, two hundred one billion, ten million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •