Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0111000100001000001100 |
3 | 1022102221211211212022211121 |
4 | 2101222221013010020030 |
5 | 2303001201404013400 |
6 | 33142325334530324 |
7 | 2052130611420520 |
oct | 221525107041014 |
9 | 38387754768747 |
10 | 10010111001100 |
11 | 320a29a773881 |
12 | 1158039b069a4 |
13 | 577c45b3b902 |
14 | 2686c5d07d80 |
15 | 1255bc92a21a |
hex | 91aa91c420c |
10010111001100 has 72 divisors (see below), whose sum is σ = 25066095611648. Its totient is φ = 3398717275200.
The previous prime is 10010111001049. The next prime is 10010111001103. The reversal of 10010111001100 is 110011101001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (10010111001103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69346146 + ... + 69490345.
Almost surely, 210010111001100 is an apocalyptic number.
10010111001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010111001100 is an abundant number, since it is smaller than the sum of its proper divisors (15055984610548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010111001100 is a wasteful number, since it uses less digits than its factorization.
10010111001100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138836615 (or 138836608 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10010111001100 its reverse (110011101001), we get a palindrome (10120122102101).
Subtracting from 10010111001100 its reverse (110011101001), we obtain a palindrome (9900099900099).
The spelling of 10010111001100 in words is "ten trillion, ten billion, one hundred eleven million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •