Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …111100100110011010011010 |
3 | 112102211110121222012012201121 |
4 | 121002022231330212122122 |
5 | 103412340011130310020 |
6 | 1030055143044435454 |
7 | 32122320235541131 |
oct | 3102125574463232 |
9 | 472743558165647 |
10 | 110100110010010 |
11 | 3209921588445a |
12 | 104221800a8b8a |
13 | 495851b81a983 |
14 | 1d28c3383a918 |
15 | cade5342cbaa |
hex | 6422adf2669a |
110100110010010 has 32 divisors (see below), whose sum is σ = 201141215638272. Its totient is φ = 43382060377920.
The previous prime is 110100110009977. The next prime is 110100110010029. The reversal of 110100110010010 is 10010011001011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110100110009975 and 110100110010002.
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 15 ways as a sum of consecutive naturals, for example, 43347679 + ... + 45817261.
It is an arithmetic number, because the mean of its divisors is an integer number (6285662988696).
Almost surely, 2110100110010010 is an apocalyptic number.
110100110010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110100110010010 is a deficient number, since it is larger than the sum of its proper divisors (91041105628262).
110100110010010 is a wasteful number, since it uses less digits than its factorization.
110100110010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536198.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110100110010010 its reverse (10010011001011), we get a palindrome (120110121011021).
The spelling of 110100110010010 in words is "one hundred ten trillion, one hundred billion, one hundred ten million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •