Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1111111000011110111110 |
3 | 1022211122222002200211211200 |
4 | 2103102331133320132332 |
5 | 2311320101240413042 |
6 | 33310012211400330 |
7 | 2063204424050556 |
oct | 223227537703676 |
9 | 38748862624750 |
10 | 10122122201022 |
11 | 325284a110187 |
12 | 117589a2b30a6 |
13 | 585686c04930 |
14 | 26dcb0260166 |
15 | 128476398c4c |
hex | 934bd7f87be |
10122122201022 has 48 divisors (see below), whose sum is σ = 24861352785360. Its totient is φ = 2950578130176.
The previous prime is 10122122200991. The next prime is 10122122201029. The reversal of 10122122201022 is 22010222122101.
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 = 10122122200986 and 10122122201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122122201029) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1138335883 + ... + 1138344774.
It is an arithmetic number, because the mean of its divisors is an integer number (517944849695).
Almost surely, 210122122201022 is an apocalyptic number.
10122122201022 is an abundant number, since it is smaller than the sum of its proper divisors (14739230584338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122122201022 is a wasteful number, since it uses less digits than its factorization.
10122122201022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2276680697 (or 2276680694 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10122122201022 its reverse (22010222122101), we get a palindrome (32132344323123).
The spelling of 10122122201022 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •