Base | Representation |
---|---|
bin | 11001000000110110111000… |
… | …111011101010100101100010 |
3 | 112102111212022000110222222201 |
4 | 121000312320323222211202 |
5 | 103404401141100013442 |
6 | 1025545535305523414 |
7 | 32112652555230136 |
oct | 3100667073524542 |
9 | 472455260428881 |
10 | 110010100001122 |
11 | 32064026547562 |
12 | 1040883baa356a |
13 | 494cba5902a99 |
14 | 1d247354953c6 |
15 | cab9362757b7 |
hex | 640db8eea962 |
110010100001122 has 32 divisors (see below), whose sum is σ = 171079496017920. Its totient is φ = 52999384570560.
The previous prime is 110010100001107. The next prime is 110010100001129. The reversal of 110010100001122 is 221100001010011.
It is a junction number, because it is equal to n+sod(n) for n = 110010100001099 and 110010100001108.
It is not an unprimeable number, because it can be changed into a prime (110010100001129) 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 15 ways as a sum of consecutive naturals, for example, 16586983 + ... + 22251925.
It is an arithmetic number, because the mean of its divisors is an integer number (5346234250560).
Almost surely, 2110010100001122 is an apocalyptic number.
110010100001122 is a deficient number, since it is larger than the sum of its proper divisors (61069396016798).
110010100001122 is a wasteful number, since it uses less digits than its factorization.
110010100001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5666338.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110010100001122 its reverse (221100001010011), we get a palindrome (331110101011133).
The spelling of 110010100001122 in words is "one hundred ten trillion, ten billion, one hundred million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.087 sec. • engine limits •