Base | Representation |
---|---|
bin | 11110100100110011001… |
… | …001000110110110001100 |
3 | 21102212022001202020201100 |
4 | 132210303021012312030 |
5 | 233411021320024400 |
6 | 4245121453143100 |
7 | 304541100051552 |
oct | 36446311066614 |
9 | 7385261666640 |
10 | 2101097033100 |
11 | 74008555510a |
12 | 29b25918aa90 |
13 | 123195426210 |
14 | 7399d4b9bd2 |
15 | 399c36b4100 |
hex | 1e933246d8c |
2101097033100 has 864 divisors, whose sum is σ = 7638017010624. Its totient is φ = 479349964800.
The previous prime is 2101097033069. The next prime is 2101097033111. The reversal of 2101097033100 is 13307901012.
It is a super-2 number, since 2×21010970331002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 763201324 + ... + 763204076.
It is an arithmetic number, because the mean of its divisors is an integer number (8840297466).
Almost surely, 22101097033100 is an apocalyptic number.
2101097033100 is a gapful number since it is divisible by the number (20) 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 2101097033100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3819008505312).
2101097033100 is an abundant number, since it is smaller than the sum of its proper divisors (5536919977524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101097033100 is a wasteful number, since it uses less digits than its factorization.
2101097033100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2907 (or 2897 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The spelling of 2101097033100 in words is "two trillion, one hundred one billion, ninety-seven million, thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •