Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0111001011011110010 |
3 | 101112012211122120111000 |
4 | 1212203020321123302 |
5 | 3301001431413020 |
6 | 122330121102430 |
7 | 10645441523436 |
oct | 1464310713362 |
9 | 345184576430 |
10 | 110111201010 |
11 | 427749a2078 |
12 | 19410027a16 |
13 | a4ca562b15 |
14 | 5487c8c9c6 |
15 | 2ce6c61090 |
hex | 19a32396f2 |
110111201010 has 64 divisors (see below), whose sum is σ = 293660841600. Its totient is φ = 29359889856.
The previous prime is 110111200999. The next prime is 110111201023. The reversal of 110111201010 is 10102111011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110111200983 and 110111201001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3794436 + ... + 3823344.
It is an arithmetic number, because the mean of its divisors is an integer number (4588450650).
Almost surely, 2110111201010 is an apocalyptic number.
110111201010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110111201010 is an abundant number, since it is smaller than the sum of its proper divisors (183549640590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110111201010 is a wasteful number, since it uses less digits than its factorization.
110111201010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43032 (or 43026 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110111201010 its reverse (10102111011), we get a palindrome (120213312021).
The spelling of 110111201010 in words is "one hundred ten billion, one hundred eleven million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •