Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …110110001110100111111010 |
3 | 112102110222212100210221111002 |
4 | 121000232123312032213322 |
5 | 103404224043124231020 |
6 | 1025541434423005002 |
7 | 32112211605323024 |
oct | 3100563366164772 |
9 | 472428770727432 |
10 | 110001022102010 |
11 | 3206019828a5a6 |
12 | 10406b27899762 |
13 | 494c089c79750 |
14 | 1d241139a3014 |
15 | cab5a430c975 |
hex | 640b9bd8e9fa |
110001022102010 has 64 divisors (see below), whose sum is σ = 225824691439872. Its totient is φ = 38270010594816.
The previous prime is 110001022102009. The next prime is 110001022102019. The reversal of 110001022102010 is 10201220100011.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110001022101982 and 110001022102000.
It is not an unprimeable number, because it can be changed into a prime (110001022102019) 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, 274349219 + ... + 274749878.
It is an arithmetic number, because the mean of its divisors is an integer number (3528510803748).
Almost surely, 2110001022102010 is an apocalyptic number.
110001022102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110001022102010 is an abundant number, since it is smaller than the sum of its proper divisors (115823669337862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001022102010 is a wasteful number, since it uses less digits than its factorization.
110001022102010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 549099207.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110001022102010 its reverse (10201220100011), we get a palindrome (120202242202021).
The spelling of 110001022102010 in words is "one hundred ten trillion, one billion, twenty-two million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •