Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …100111000011110001100 |
3 | 21002012101012201220011200 |
4 | 131012221330320132030 |
5 | 230232010320231332 |
6 | 4130443054545500 |
7 | 264332065604463 |
oct | 35065174703614 |
9 | 7065335656150 |
10 | 2000011102092 |
11 | 701222143a73 |
12 | 283747808290 |
13 | 1167a5950763 |
14 | 6cb3013d9da |
15 | 37058e7217c |
hex | 1d1a9f3878c |
2000011102092 has 72 divisors (see below), whose sum is σ = 5140318659840. Its totient is φ = 655546076640.
The previous prime is 2000011102073. The next prime is 2000011102093. The reversal of 2000011102092 is 2902011100002.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2000011102093) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63568 + ... + 2001015.
It is an arithmetic number, because the mean of its divisors is an integer number (71393314720).
Almost surely, 22000011102092 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000011102092, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2570159329920).
2000011102092 is an abundant number, since it is smaller than the sum of its proper divisors (3140307557748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000011102092 is a wasteful number, since it uses less digits than its factorization.
2000011102092 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2065043 (or 2065038 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 2000011102092 its reverse (2902011100002), we get a palindrome (4902022202094).
The spelling of 2000011102092 in words is "two trillion, eleven million, one hundred two thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •