Base | Representation |
---|---|
bin | 1010001100100000100010… |
… | …1110010110001111010000 |
3 | 1110200122222221102100210222 |
4 | 2203020020232112033100 |
5 | 2432131100304310000 |
6 | 35501450304212212 |
7 | 2234616344256365 |
oct | 243101056261720 |
9 | 43618887370728 |
10 | 11210011010000 |
11 | 3632158a750a0 |
12 | 13106aa00a068 |
13 | 63413a7b6b8a |
14 | 2aa7d304446c |
15 | 1468e8963a85 |
hex | a3208b963d0 |
11210011010000 has 100 divisors (see below), whose sum is σ = 29607881370144. Its totient is φ = 4076367600000.
The previous prime is 11210011009979. The next prime is 11210011010053. The reversal of 11210011010000 is 1011001211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 11210011010000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 50844596 + ... + 51064595.
Almost surely, 211210011010000 is an apocalyptic number.
11210011010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11210011010000 is an abundant number, since it is smaller than the sum of its proper divisors (18397870360144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210011010000 is a wasteful number, since it uses less digits than its factorization.
11210011010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101909230 (or 101909209 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11210011010000 its reverse (1011001211), we get a palindrome (11211022011211).
The spelling of 11210011010000 in words is "eleven trillion, two hundred ten billion, eleven million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •