Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000010100111100111110010 |
3 | 112102212111201220122001222121 |
4 | 121002110313002213213302 |
5 | 103413024312000013020 |
6 | 1030104143423024454 |
7 | 32123154141124051 |
oct | 3102246702474762 |
9 | 472774656561877 |
10 | 110111000001010 |
11 | 320a28a3a04918 |
12 | 104242bb13b12a |
13 | 4959565a08b28 |
14 | 1d29587c72398 |
15 | cae38e4dbbaa |
hex | 6425370a79f2 |
110111000001010 has 16 divisors (see below), whose sum is σ = 198199923316416. Its totient is φ = 44044372597168.
The previous prime is 110111000000999. The next prime is 110111000001029. The reversal of 110111000001010 is 10100000111011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110111000000984 and 110111000001002.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 23617587 + ... + 27892873.
It is an arithmetic number, because the mean of its divisors is an integer number (12387495207276).
Almost surely, 2110111000001010 is an apocalyptic number.
110111000001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110111000001010 is a deficient number, since it is larger than the sum of its proper divisors (88088923315406).
110111000001010 is a wasteful number, since it uses less digits than its factorization.
110111000001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6850817.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110111000001010 its reverse (10100000111011), we get a palindrome (120211000112021).
The spelling of 110111000001010 in words is "one hundred ten trillion, one hundred eleven billion, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •