Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …01000001010111110100 |
3 | 10120122211101022022212200 |
4 | 32231222111001113310 |
5 | 113031213402210400 |
6 | 2052254331544500 |
7 | 133023013324032 |
oct | 16555225012764 |
9 | 3518741268780 |
10 | 1011101210100 |
11 | 35a8953013a3 |
12 | 143b5b8bb130 |
13 | 7446716b707 |
14 | 36d1a941552 |
15 | 1b47b148b00 |
hex | eb6a5415f4 |
1011101210100 has 108 divisors (see below), whose sum is σ = 3170536343520. Its totient is φ = 269516750400.
The previous prime is 1011101210099. The next prime is 1011101210113. The reversal of 1011101210100 is 10121011101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1984665 + ... + 2441535.
Almost surely, 21011101210100 is an apocalyptic number.
1011101210100 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 1011101210100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1585268171760).
1011101210100 is an abundant number, since it is smaller than the sum of its proper divisors (2159435133420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011101210100 is a wasteful number, since it uses less digits than its factorization.
1011101210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459350 (or 459340 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011101210100 its reverse (10121011101), we get a palindrome (1021222221201).
The spelling of 1011101210100 in words is "one trillion, eleven billion, one hundred one million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •