Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0001011000101001110 |
3 | 101112012001120120002121 |
4 | 1212202132023011032 |
5 | 3300441100013402 |
6 | 122325041043154 |
7 | 10645244365600 |
oct | 1464236130516 |
9 | 345161516077 |
10 | 110100001102 |
11 | 42769642453 |
12 | 194083264ba |
13 | a4c8141060 |
14 | 54865b5170 |
15 | 2ce5c9c837 |
hex | 19a278b14e |
110100001102 has 24 divisors (see below), whose sum is σ = 206891213256. Its totient is φ = 43556043888.
The previous prime is 110100001093. The next prime is 110100001163. The reversal of 110100001102 is 201100001011.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43209088 + ... + 43211635.
It is an arithmetic number, because the mean of its divisors is an integer number (8620467219).
Almost surely, 2110100001102 is an apocalyptic number.
110100001102 is a deficient number, since it is larger than the sum of its proper divisors (96791212154).
110100001102 is a wasteful number, since it uses less digits than its factorization.
110100001102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86420752 (or 86420745 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 110100001102 its reverse (201100001011), we get a palindrome (311200002113).
Subtracting 110100001102 from its reverse (201100001011), we obtain a palindrome (90999999909).
The spelling of 110100001102 in words is "one hundred ten billion, one hundred million, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •