Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …11110001111011000010 |
3 | 10112201001011011012200110 |
4 | 32210112313301323002 |
5 | 112400233420213442 |
6 | 2043523141132150 |
7 | 132220315645626 |
oct | 16442667617302 |
9 | 3481034135613 |
10 | 1001111101122 |
11 | 356629132690 |
12 | 1420320ba056 |
13 | 73534535322 |
14 | 3664dc35186 |
15 | 1b09409169c |
hex | e916df1ec2 |
1001111101122 has 64 divisors (see below), whose sum is σ = 2280436706304. Its totient is φ = 290020885440.
The previous prime is 1001111101121. The next prime is 1001111101129. The reversal of 1001111101122 is 2211011111001.
It is a junction number, because it is equal to n+sod(n) for n = 1001111101098 and 1001111101107.
It is not an unprimeable number, because it can be changed into a prime (1001111101121) 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, 2657488 + ... + 3010724.
It is an arithmetic number, because the mean of its divisors is an integer number (35631823536).
Almost surely, 21001111101122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001111101122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1140218353152).
1001111101122 is an abundant number, since it is smaller than the sum of its proper divisors (1279325605182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001111101122 is a wasteful number, since it uses less digits than its factorization.
1001111101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355143.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1001111101122 its reverse (2211011111001), we get a palindrome (3212122212123).
The spelling of 1001111101122 in words is "one trillion, one billion, one hundred eleven million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •