Base | Representation |
---|---|
bin | 11101011010010011100… |
… | …110101110011000000100 |
3 | 21011012211200222100122020 |
4 | 131122103212232120010 |
5 | 231103213411000200 |
6 | 4144252515403140 |
7 | 266010005211204 |
oct | 35322346563004 |
9 | 7135750870566 |
10 | 2021111031300 |
11 | 70a16a53a099 |
12 | 287855bb34b0 |
13 | 118789182a7a |
14 | 6db72546404 |
15 | 3789155cea0 |
hex | 1d6939ae604 |
2021111031300 has 72 divisors (see below), whose sum is σ = 5851619347392. Its totient is φ = 538606128000.
The previous prime is 2021111031293. The next prime is 2021111031323. The reversal of 2021111031300 is 31301111202.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2021111031300.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1776031 + ... + 2682630.
It is an arithmetic number, because the mean of its divisors is an integer number (81272490936).
Almost surely, 22021111031300 is an apocalyptic number.
2021111031300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2021111031300 is an abundant number, since it is smaller than the sum of its proper divisors (3830508316092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2021111031300 is a wasteful number, since it uses less digits than its factorization.
2021111031300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4460189 (or 4460182 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 2021111031300 its reverse (31301111202), we get a palindrome (2052412142502).
The spelling of 2021111031300 in words is "two trillion, twenty-one billion, one hundred eleven million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.236 sec. • engine limits •