Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01001001111011111010 |
3 | 10112121110110111220122010 |
4 | 32203123101021323322 |
5 | 112341211421320442 |
6 | 2043240020110350 |
7 | 132153454154262 |
oct | 16433321117372 |
9 | 3477413456563 |
10 | 1000111120122 |
11 | 356165722104 |
12 | 1419b32353b6 |
13 | 734053039aa |
14 | 365970d07a2 |
15 | 1b0363b5b9c |
hex | e8db449efa |
1000111120122 has 8 divisors (see below), whose sum is σ = 2000222240256. Its totient is φ = 333370373372.
The previous prime is 1000111120103. The next prime is 1000111120123. The reversal of 1000111120122 is 2210211110001.
It is a sphenic number, since it is the product of 3 distinct primes.
1000111120122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1000111120098 and 1000111120107.
It is not an unprimeable number, because it can be changed into a prime (1000111120123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83342593338 + ... + 83342593349.
It is an arithmetic number, because the mean of its divisors is an integer number (250027780032).
Almost surely, 21000111120122 is an apocalyptic number.
1000111120122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000111120122 is a wasteful number, since it uses less digits than its factorization.
1000111120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166685186692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1000111120122 its reverse (2210211110001), we get a palindrome (3210322230123).
The spelling of 1000111120122 in words is "one trillion, one hundred eleven million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •