Base | Representation |
---|---|
bin | 10100111000010110… |
… | …10000111101010101 |
3 | 1001221020211202222110 |
4 | 22130023100331111 |
5 | 140424243231313 |
6 | 5052212021233 |
7 | 544540363320 |
oct | 123413207525 |
9 | 31836752873 |
10 | 11210133333 |
11 | 4832912103 |
12 | 220a301819 |
13 | 109861c0b9 |
14 | 784b6d7b7 |
15 | 45924aec3 |
hex | 29c2d0f55 |
11210133333 has 16 divisors (see below), whose sum is σ = 17102067840. Its totient is φ = 6398305536.
The previous prime is 11210133257. The next prime is 11210133359. The reversal of 11210133333 is 33333101211.
11210133333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11210133333 - 216 = 11210067797 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210133533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 293448 + ... + 329441.
It is an arithmetic number, because the mean of its divisors is an integer number (1068879240).
Almost surely, 211210133333 is an apocalyptic number.
It is an amenable number.
11210133333 is a deficient number, since it is larger than the sum of its proper divisors (5891934507).
11210133333 is an equidigital number, since it uses as much as digits as its factorization.
11210133333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623756.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11210133333 its reverse (33333101211), we get a palindrome (44543234544).
The spelling of 11210133333 in words is "eleven billion, two hundred ten million, one hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •