Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1010100011111001010100 |
3 | 1022110001010212202112211121 |
4 | 2101223132022203321110 |
5 | 2303010012241010400 |
6 | 33142553533013324 |
7 | 2052161640262504 |
oct | 221533612437124 |
9 | 38401125675747 |
10 | 10011001110100 |
11 | 320a70715a951 |
12 | 1158248024244 |
13 | 578058381223 |
14 | 26876c20ba04 |
15 | 125620b5121a |
hex | 91ade2a3e54 |
10011001110100 has 36 divisors (see below), whose sum is σ = 21767061131424. Its totient is φ = 3996439389280.
The previous prime is 10011001110079. The next prime is 10011001110119. The reversal of 10011001110100 is 101110011001.
It is a happy number.
10011001110100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 99462634 + ... + 99563233.
It is an arithmetic number, because the mean of its divisors is an integer number (604640586984).
Almost surely, 210011001110100 is an apocalyptic number.
10011001110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10011001110100 is an abundant number, since it is smaller than the sum of its proper divisors (11756060021324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011001110100 is a wasteful number, since it uses less digits than its factorization.
10011001110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199026384 (or 199026377 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10011001110100 its reverse (101110011001), we get a palindrome (10112111121101).
The spelling of 10011001110100 in words is "ten trillion, eleven billion, one million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •