Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1011001101010000000100 |
3 | 1022210111221020222211201120 |
4 | 2103013300323031100010 |
5 | 2311120441111200400 |
6 | 33300303232153540 |
7 | 2062300463634630 |
oct | 223076073152004 |
9 | 38714836884646 |
10 | 10110100100100 |
11 | 324873aa33890 |
12 | 11734a40988b0 |
13 | 5844bc302650 |
14 | 26d48d72bdc0 |
15 | 127ec0c0eca0 |
hex | 931f0ecd404 |
10110100100100 has 288 divisors, whose sum is σ = 39275265555456. Its totient is φ = 1939199961600.
The previous prime is 10110100100003. The next prime is 10110100100141. The reversal of 10110100100100 is 100100101101.
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 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 95 ways as a sum of consecutive naturals, for example, 16533034 + ... + 17133633.
Almost surely, 210110100100100 is an apocalyptic number.
10110100100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10110100100100 is an abundant number, since it is smaller than the sum of its proper divisors (29165165455356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110100100100 is a wasteful number, since it uses less digits than its factorization.
10110100100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33666715 (or 33666708 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10110100100100 its reverse (100100101101), we get a palindrome (10210200201201).
The spelling of 10110100100100 in words is "ten trillion, one hundred ten billion, one hundred million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •