Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …0101001100100011001110 |
3 | 1022211122221022122100001020 |
4 | 2103102330311030203032 |
5 | 2311320040404323042 |
6 | 33310011131455010 |
7 | 2063204226663633 |
oct | 223227465144316 |
9 | 38748838570036 |
10 | 10122111011022 |
11 | 3252843867a4a |
12 | 11758965b7466 |
13 | 5856847b752a |
14 | 26dcac98a18a |
15 | 1284753d83ec |
hex | 934bcd4c8ce |
10122111011022 has 32 divisors (see below), whose sum is σ = 21435584781312. Its totient is φ = 3175486287744.
The previous prime is 10122111011021. The next prime is 10122111011057. The reversal of 10122111011022 is 22011011122101.
It is a happy number.
10122111011022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10122111010992 and 10122111011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122111011021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3029923 + ... + 5424449.
It is an arithmetic number, because the mean of its divisors is an integer number (669862024416).
Almost surely, 210122111011022 is an apocalyptic number.
10122111011022 is an abundant number, since it is smaller than the sum of its proper divisors (11313473770290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122111011022 is a wasteful number, since it uses less digits than its factorization.
10122111011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2435992.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10122111011022 its reverse (22011011122101), we get a palindrome (32133122133123).
The spelling of 10122111011022 in words is "ten trillion, one hundred twenty-two billion, one hundred eleven million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •