Base | Representation |
---|---|
bin | 11001000010001011101001… |
… | …000101001000010111111010 |
3 | 112102211120012002222201002202 |
4 | 121002023221011020113322 |
5 | 103412344024114231020 |
6 | 1030055425324430202 |
7 | 32122353643304465 |
oct | 3102135105102772 |
9 | 472746162881082 |
10 | 110101102102010 |
11 | 320996848968a8 |
12 | 104223b83a8362 |
13 | 4958649219566 |
14 | 1d28cc94ca2dc |
15 | cadeb059ae75 |
hex | 6422e91485fa |
110101102102010 has 32 divisors (see below), whose sum is σ = 200903443851600. Its totient is φ = 43435711807488.
The previous prime is 110101102101989. The next prime is 110101102102097. The reversal of 110101102102010 is 10201201101011.
It can be written as a sum of positive squares in 8 ways, for example, as 8520485106169 + 101580616995841 = 2918987^2 + 10078721^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110101102101982 and 110101102102000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19751114 + ... + 24704426.
Almost surely, 2110101102102010 is an apocalyptic number.
110101102102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110101102102010 is a deficient number, since it is larger than the sum of its proper divisors (90802341749590).
110101102102010 is a wasteful number, since it uses less digits than its factorization.
110101102102010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4983842.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110101102102010 its reverse (10201201101011), we get a palindrome (120302303203021).
The spelling of 110101102102010 in words is "one hundred ten trillion, one hundred one billion, one hundred two million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •