Base | Representation |
---|---|
bin | 10011000000001101… |
… | …01110100111011101 |
3 | 222100000110002211022 |
4 | 21200012232213131 |
5 | 131343242424013 |
6 | 4404210533525 |
7 | 510552133220 |
oct | 114006564735 |
9 | 28300402738 |
10 | 10202311133 |
11 | 4365a363a3 |
12 | 1b888972a5 |
13 | c678a36c1 |
14 | 6cad875b7 |
15 | 3eaa22008 |
hex | 2601ae9dd |
10202311133 has 32 divisors (see below), whose sum is σ = 12576591360. Its totient is φ = 8077547520.
The previous prime is 10202311127. The next prime is 10202311159. The reversal of 10202311133 is 33111320201.
10202311133 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 10202311133 - 210 = 10202310109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202311123) 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 31 ways as a sum of consecutive naturals, for example, 1932185 + ... + 1937457.
It is an arithmetic number, because the mean of its divisors is an integer number (393018480).
Almost surely, 210202311133 is an apocalyptic number.
It is an amenable number.
10202311133 is a deficient number, since it is larger than the sum of its proper divisors (2374280227).
10202311133 is a wasteful number, since it uses less digits than its factorization.
10202311133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5597.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10202311133 its reverse (33111320201), we get a palindrome (43313631334).
The spelling of 10202311133 in words is "ten billion, two hundred two million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •