Base | Representation |
---|---|
bin | 11101011001011111001… |
… | …101111010000000011110 |
3 | 21011010120110010112102120 |
4 | 131121133031322000132 |
5 | 231044413410010420 |
6 | 4144025401203410 |
7 | 265646143413564 |
oct | 35313715720036 |
9 | 7133513115376 |
10 | 2020232110110 |
11 | 7098593a4645 |
12 | 28764b790566 |
13 | 118679059866 |
14 | 6dacb915a34 |
15 | 3783e2e6d40 |
hex | 1d65f37a01e |
2020232110110 has 32 divisors (see below), whose sum is σ = 4848600490272. Its totient is φ = 538723737600.
The previous prime is 2020232110097. The next prime is 2020232110111. The reversal of 2020232110110 is 110112320202.
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 2020232110110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020232110111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4210510 + ... + 4665710.
It is an arithmetic number, because the mean of its divisors is an integer number (151518765321).
Almost surely, 22020232110110 is an apocalyptic number.
2020232110110 is an abundant number, since it is smaller than the sum of its proper divisors (2828368380162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020232110110 is a wasteful number, since it uses less digits than its factorization.
2020232110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603148.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2020232110110 its reverse (110112320202), we get a palindrome (2130344430312).
The spelling of 2020232110110 in words is "two trillion, twenty billion, two hundred thirty-two million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •