Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …100001110000111011011 |
3 | 21102202112010220102201020 |
4 | 132203303010032013123 |
5 | 233401321113312311 |
6 | 4244423051453523 |
7 | 304502334364440 |
oct | 36436304160733 |
9 | 7382463812636 |
10 | 2100022010331 |
11 | 73a68374a643 |
12 | 29abb91572a3 |
13 | 1230537ac27b |
14 | 738da7dd9c7 |
15 | 3995e113c06 |
hex | 1e8f310e1db |
2100022010331 has 32 divisors (see below), whose sum is σ = 3339297389568. Its totient is φ = 1147792757760.
The previous prime is 2100022010311. The next prime is 2100022010371. The reversal of 2100022010331 is 1330102200012.
It is not a de Polignac number, because 2100022010331 - 210 = 2100022009307 is a prime.
It is a super-2 number, since 2×21000220103312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2100022010331.
It is not an unprimeable number, because it can be changed into a prime (2100022010311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14825715 + ... + 14966691.
It is an arithmetic number, because the mean of its divisors is an integer number (104353043424).
Almost surely, 22100022010331 is an apocalyptic number.
2100022010331 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2100022010331 is a deficient number, since it is larger than the sum of its proper divisors (1239275379237).
2100022010331 is a wasteful number, since it uses less digits than its factorization.
2100022010331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171851.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2100022010331 its reverse (1330102200012), we get a palindrome (3430124210343).
The spelling of 2100022010331 in words is "two trillion, one hundred billion, twenty-two million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •