Base | Representation |
---|---|
bin | 11101100011100111000… |
… | …111101011010011111110 |
3 | 21012011121222221220012000 |
4 | 131203213013223103332 |
5 | 231234144120104042 |
6 | 4153024143123130 |
7 | 266512414050303 |
oct | 35434707532376 |
9 | 7164558856160 |
10 | 2031102113022 |
11 | 713427212724 |
12 | 289783ba34a6 |
13 | 1196bc069b48 |
14 | 7043d4270aa |
15 | 37c7875874c |
hex | 1d8e71eb4fe |
2031102113022 has 16 divisors (see below), whose sum is σ = 4513560251280. Its totient is φ = 677034037656.
The previous prime is 2031102113017. The next prime is 2031102113059. The reversal of 2031102113022 is 2203112011302.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2031102112986 and 2031102113004.
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, 18806500993 + ... + 18806501100.
It is an arithmetic number, because the mean of its divisors is an integer number (282097515705).
Almost surely, 22031102113022 is an apocalyptic number.
2031102113022 is an abundant number, since it is smaller than the sum of its proper divisors (2482458138258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2031102113022 is a wasteful number, since it uses less digits than its factorization.
2031102113022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37613002104 (or 37613002098 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2031102113022 its reverse (2203112011302), we get a palindrome (4234214124324).
It can be divided in two parts, 203110 and 2113022, that added together give a palindrome (2316132).
The spelling of 2031102113022 in words is "two trillion, thirty-one billion, one hundred two million, one hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •