| Base | Representation |
|---|---|
| bin | 11001000010001010100111… |
| … | …111111001000010111110100 |
| 3 | 112102211110101000000200122020 |
| 4 | 121002022213333020113310 |
| 5 | 103412334310030310400 |
| 6 | 1030055125113233140 |
| 7 | 32122314612546165 |
| oct | 3102124777102764 |
| 9 | 472743330020566 |
| 10 | 110100010010100 |
| 11 | 32099174393000 |
| 12 | 104221527027b0 |
| 13 | 4958503ba7226 |
| 14 | 1d28c2444976c |
| 15 | cade497782a0 |
| hex | 6422a7fc85f4 |
110100010010100 has 576 divisors, whose sum is σ = 355003866298368. Its totient is φ = 26340004838400.
The previous prime is 110100010010059. The next prime is 110100010010101. The reversal of 110100010010100 is 1010010001011.
110100010010100 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100010010101) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 51137950624 + ... + 51137952776.
It is an arithmetic number, because the mean of its divisors is an integer number (616326156768).
Almost surely, 2110100010010100 is an apocalyptic number.
110100010010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110100010010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177501933149184).
110100010010100 is an abundant number, since it is smaller than the sum of its proper divisors (244903856288268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100010010100 is a wasteful number, since it uses less digits than its factorization.
110100010010100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3829 (or 3800 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110100010010100 its reverse (1010010001011), we get a palindrome (111110020011111).
The spelling of 110100010010100 in words is "one hundred ten trillion, one hundred billion, ten million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •