Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0110011110010100001010 |
3 | 1100011011102200201211011000 |
4 | 2110211300112132110022 |
5 | 2314244133140431442 |
6 | 33414513455115430 |
7 | 2102502435434340 |
oct | 224456026362412 |
9 | 40134380654130 |
10 | 10211022202122 |
11 | 3287519917875 |
12 | 118ab6a812b76 |
13 | 590b83b76891 |
14 | 27430501d990 |
15 | 12a92ad8ed4c |
hex | 9497059e50a |
10211022202122 has 64 divisors (see below), whose sum is σ = 25976933821440. Its totient is φ = 2912464775088.
The previous prime is 10211022202109. The next prime is 10211022202133. The reversal of 10211022202122 is 22120222011201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10211022202095 and 10211022202104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22787728 + ... + 23231499.
It is an arithmetic number, because the mean of its divisors is an integer number (405889590960).
Almost surely, 210211022202122 is an apocalyptic number.
10211022202122 is an abundant number, since it is smaller than the sum of its proper divisors (15765911619318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211022202122 is a wasteful number, since it uses less digits than its factorization.
10211022202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46019832 (or 46019826 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10211022202122 its reverse (22120222011201), we get a palindrome (32331244213323).
The spelling of 10211022202122 in words is "ten trillion, two hundred eleven billion, twenty-two million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •