Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …111111100011001110111010 |
3 | 112102211110101000020021120010 |
4 | 121002022213333203032322 |
5 | 103412334310042320442 |
6 | 1030055125115442350 |
7 | 32122314613515021 |
oct | 3102124777431672 |
9 | 472743330207503 |
10 | 110100010120122 |
11 | 32099174458730 |
12 | 104221527563b6 |
13 | 4958503c15329 |
14 | 1d28c244778b8 |
15 | cade4979ab9c |
hex | 6422a7fe33ba |
110100010120122 has 128 divisors (see below), whose sum is σ = 245379448846080. Its totient is φ = 32654004387840.
The previous prime is 110100010120081. The next prime is 110100010120153. The reversal of 110100010120122 is 221021010001011.
It is a junction number, because it is equal to n+sod(n) for n = 110100010120098 and 110100010120107.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1817131404 + ... + 1817191992.
It is an arithmetic number, because the mean of its divisors is an integer number (1917026944110).
Almost surely, 2110100010120122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110100010120122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122689724423040).
110100010120122 is an abundant number, since it is smaller than the sum of its proper divisors (135279438725958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100010120122 is a wasteful number, since it uses less digits than its factorization.
110100010120122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63568.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110100010120122 its reverse (221021010001011), we get a palindrome (331121020121133).
The spelling of 110100010120122 in words is "one hundred ten trillion, one hundred billion, ten million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •