Base | Representation |
---|---|
bin | 11110100100111111011… |
… | …010111011000101011110 |
3 | 21102212211102100222111020 |
4 | 132210333122323011132 |
5 | 233411432033430420 |
6 | 4245154132305010 |
7 | 304546151024124 |
oct | 36447732730536 |
9 | 7385742328436 |
10 | 2101303030110 |
11 | 740180863779 |
12 | 29b2b6172166 |
13 | 1231c900003b |
14 | 739bc9bd914 |
15 | 399d6805340 |
hex | 1e93f6bb15e |
2101303030110 has 64 divisors (see below), whose sum is σ = 5065061246784. Its totient is φ = 557911296000.
The previous prime is 2101303030093. The next prime is 2101303030117. The reversal of 2101303030110 is 110303031012.
It is a super-2 number, since 2×21013030301102 (a number of 25 digits) contains 22 as substring.
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 2101303030110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101303030117) 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, 40150960 + ... + 40203260.
It is an arithmetic number, because the mean of its divisors is an integer number (79141581981).
Almost surely, 22101303030110 is an apocalyptic number.
2101303030110 is an abundant number, since it is smaller than the sum of its proper divisors (2963758216674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101303030110 is a wasteful number, since it uses less digits than its factorization.
2101303030110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58109.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2101303030110 its reverse (110303031012), we get a palindrome (2211606061122).
The spelling of 2101303030110 in words is "two trillion, one hundred one billion, three hundred three million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •