Base | Representation |
---|---|
bin | 11110100100101110000… |
… | …001101011100000010100 |
3 | 21102212002002020110212101 |
4 | 132210232001223200110 |
5 | 233410332331400040 |
6 | 4245105145331444 |
7 | 304536005352415 |
oct | 36445601534024 |
9 | 7385062213771 |
10 | 2101011200020 |
11 | 74004105a487 |
12 | 29b234496b84 |
13 | 123180702b05 |
14 | 73991d3580c |
15 | 399badac09a |
hex | 1e92e06b814 |
2101011200020 has 24 divisors (see below), whose sum is σ = 4412738580264. Its totient is φ = 840287325696.
The previous prime is 2101011200011. The next prime is 2101011200033. The reversal of 2101011200020 is 200021101012.
It can be written as a sum of positive squares in 4 ways, for example, as 637037037316 + 1463974162704 = 798146^2 + 1209948^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7175017 + ... + 7462096.
It is an arithmetic number, because the mean of its divisors is an integer number (183864107511).
Almost surely, 22101011200020 is an apocalyptic number.
2101011200020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101011200020 is an abundant number, since it is smaller than the sum of its proper divisors (2311727380244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101011200020 is a wasteful number, since it uses less digits than its factorization.
2101011200020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14644299 (or 14644297 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2101011200020 its reverse (200021101012), we get a palindrome (2301032301032).
The spelling of 2101011200020 in words is "two trillion, one hundred one billion, eleven million, two hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •