Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …1010111010001001111000 |
3 | 1102222201220022001100211201 |
4 | 2200033232122322021320 |
5 | 2420410034302223000 |
6 | 35230502111103544 |
7 | 2214406440612556 |
oct | 240175632721170 |
9 | 42881808040751 |
10 | 11012001211000 |
11 | 3566188668409 |
12 | 129a248b11bb4 |
13 | 61b5728c0b3a |
14 | 2a0dab3cabd6 |
15 | 1416aa0b896a |
hex | a03ee6ba278 |
11012001211000 has 64 divisors (see below), whose sum is σ = 25768583100000. Its totient is φ = 4404714969600.
The previous prime is 11012001210983. The next prime is 11012001211007. The reversal of 11012001211000 is 11210021011.
11012001211000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012001211007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86475376 + ... + 86602624.
Almost surely, 211012001211000 is an apocalyptic number.
11012001211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012001211000 is an abundant number, since it is smaller than the sum of its proper divisors (14756581889000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012001211000 is a wasteful number, since it uses less digits than its factorization.
11012001211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213809 (or 213795 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11012001211000 its reverse (11210021011), we get a palindrome (11023211232011).
The spelling of 11012001211000 in words is "eleven trillion, twelve billion, one million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •