Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …101100100000011000000 |
3 | 10221020020012112120112222 |
4 | 100022321111210003000 |
5 | 121201230004000000 |
6 | 2210252220110212 |
7 | 143165562440513 |
oct | 20127125440300 |
9 | 3836205476488 |
10 | 1111211000000 |
11 | 399297705252 |
12 | 15b43a395368 |
13 | 80a2c63b99a |
14 | 3bad63c0d7a |
15 | 1dd89d1da85 |
hex | 102b95640c0 |
1111211000000 has 98 divisors (see below), whose sum is σ = 2756291359644. Its totient is φ = 444484000000.
The previous prime is 1111210999991. The next prime is 1111211000021. The reversal of 1111211000000 is 1121111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 444395 + ... + 1555605.
Almost surely, 21111211000000 is an apocalyptic number.
1111211000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1111211000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1378145679822).
1111211000000 is an abundant number, since it is smaller than the sum of its proper divisors (1645080359644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111211000000 is an frugal number, since it uses more digits than its factorization.
1111211000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1111253 (or 1111218 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1111211000000 its reverse (1121111), we get a palindrome (1111212121111).
The spelling of 1111211000000 in words is "one trillion, one hundred eleven billion, two hundred eleven million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •