Base | Representation |
---|---|
bin | 1001010011000000010010… |
… | …1001110001000001000110 |
3 | 1100012020000201222112120100 |
4 | 2110300010221301001012 |
5 | 2314434330124101042 |
6 | 33423545031344530 |
7 | 2103344113155423 |
oct | 224600451610106 |
9 | 40166021875510 |
10 | 10222100222022 |
11 | 32911940a4117 |
12 | 1191140822146 |
13 | 591c2acba240 |
14 | 274a763dcd4a |
15 | 12ad786e124c |
hex | 94c04a71046 |
10222100222022 has 24 divisors (see below), whose sum is σ = 23851567185264. Its totient is φ = 3145261606704.
The previous prime is 10222100222021. The next prime is 10222100222027. The reversal of 10222100222022 is 22022200122201.
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 = 10222100221986 and 10222100222004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222100222021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21842094258 + ... + 21842094725.
It is an arithmetic number, because the mean of its divisors is an integer number (993815299386).
Almost surely, 210222100222022 is an apocalyptic number.
10222100222022 is an abundant number, since it is smaller than the sum of its proper divisors (13629466963242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222100222022 is a wasteful number, since it uses less digits than its factorization.
10222100222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43684189004 (or 43684189001 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 10222100222022 its reverse (22022200122201), we get a palindrome (32244300344223).
The spelling of 10222100222022 in words is "ten trillion, two hundred twenty-two billion, one hundred million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •