Base | Representation |
---|---|
bin | 10010101110110101… |
… | …011011100100100101 |
3 | 1220220201100220211101 |
4 | 102232311123210211 |
5 | 312142424030313 |
6 | 13123445440101 |
7 | 1311264424360 |
oct | 225665334445 |
9 | 56821326741 |
10 | 20113111333 |
11 | 8591366267 |
12 | 3a93a10031 |
13 | 1b86c5c213 |
14 | d8b32b0d7 |
15 | 7cab605dd |
hex | 4aed5b925 |
20113111333 has 64 divisors (see below), whose sum is σ = 25669140480. Its totient is φ = 15371985600.
The previous prime is 20113111303. The next prime is 20113111393. The reversal of 20113111333 is 33311131102.
It is a cyclic number.
It is not a de Polignac number, because 20113111333 - 213 = 20113103141 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20113111333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113111303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 52514460 + ... + 52514842.
It is an arithmetic number, because the mean of its divisors is an integer number (401080320).
Almost surely, 220113111333 is an apocalyptic number.
It is an amenable number.
20113111333 is a deficient number, since it is larger than the sum of its proper divisors (5556029147).
20113111333 is a wasteful number, since it uses less digits than its factorization.
20113111333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 20113111333 its reverse (33311131102), we get a palindrome (53424242435).
The spelling of 20113111333 in words is "twenty billion, one hundred thirteen million, one hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •