Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …011111110000011101010 |
3 | 10220011211121010200202200 |
4 | 100000221223332003222 |
5 | 121011213010120020 |
6 | 2201232512241030 |
7 | 142326153240144 |
oct | 20005153760352 |
9 | 3804747120680 |
10 | 1100211020010 |
11 | 3946624904a3 |
12 | 15928a540176 |
13 | 7c99872049b |
14 | 3b371517c94 |
15 | 1d944285590 |
hex | 10029afe0ea |
1100211020010 has 24 divisors (see below), whose sum is σ = 2860548652260. Its totient is φ = 293389605312.
The previous prime is 1100211019939. The next prime is 1100211020053. The reversal of 1100211020010 is 100201120011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1096252974441 + 3958045569 = 1047021^2 + 62913^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100211019974 and 1100211020001.
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, 6112283355 + ... + 6112283534.
Almost surely, 21100211020010 is an apocalyptic number.
1100211020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100211020010 is an abundant number, since it is smaller than the sum of its proper divisors (1760337632250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100211020010 is a wasteful number, since it uses less digits than its factorization.
1100211020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12224566902 (or 12224566899 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100211020010 its reverse (100201120011), we get a palindrome (1200412140021).
The spelling of 1100211020010 in words is "one trillion, one hundred billion, two hundred eleven million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •