Base | Representation |
---|---|
bin | 11110100101110000110… |
… | …001110011100101101100 |
3 | 21102221222010112220200222 |
4 | 132211300301303211230 |
5 | 233420131031043200 |
6 | 4245412233110512 |
7 | 304605524430662 |
oct | 36456061634554 |
9 | 7387863486628 |
10 | 2102131112300 |
11 | 74056623511a |
12 | 29b4a7558438 |
13 | 1232cb735cbb |
14 | 73a5a978c32 |
15 | 39a34377d85 |
hex | 1e970c7396c |
2102131112300 has 36 divisors (see below), whose sum is σ = 4612878741240. Its totient is φ = 831404661120.
The previous prime is 2102131112299. The next prime is 2102131112303. The reversal of 2102131112300 is 32111312012.
It is a super-2 number, since 2×21021311123002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2102131112303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 118088354 + ... + 118106153.
It is an arithmetic number, because the mean of its divisors is an integer number (128135520590).
Almost surely, 22102131112300 is an apocalyptic number.
2102131112300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2102131112300 is an abundant number, since it is smaller than the sum of its proper divisors (2510747628940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102131112300 is a wasteful number, since it uses less digits than its factorization.
2102131112300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236194610 (or 236194603 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2102131112300 its reverse (32111312012), we get a palindrome (2134242424312).
The spelling of 2102131112300 in words is "two trillion, one hundred two billion, one hundred thirty-one million, one hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •