Base | Representation |
---|---|
bin | 10011010010001100… |
… | …00100111011001111 |
3 | 222201112020202200222 |
4 | 21221012010323033 |
5 | 132200400312221 |
6 | 4431155341555 |
7 | 514363124651 |
oct | 115106047317 |
9 | 28645222628 |
10 | 10353135311 |
11 | 4433090882 |
12 | 200b2b18bb |
13 | c8cc0078c |
14 | 7030086d1 |
15 | 408db59ab |
hex | 269184ecf |
10353135311 has 4 divisors (see below), whose sum is σ = 10389719112. Its totient is φ = 10316551512.
The previous prime is 10353135293. The next prime is 10353135313. The reversal of 10353135311 is 11353135301.
10353135311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11353135301 = 31 ⋅366230171.
It is a cyclic number.
It is not a de Polignac number, because 10353135311 - 210 = 10353134287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10353135313) 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 3 ways as a sum of consecutive naturals, for example, 18291476 + ... + 18292041.
It is an arithmetic number, because the mean of its divisors is an integer number (2597429778).
Almost surely, 210353135311 is an apocalyptic number.
10353135311 is a deficient number, since it is larger than the sum of its proper divisors (36583801).
10353135311 is an equidigital number, since it uses as much as digits as its factorization.
10353135311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36583800.
The product of its (nonzero) digits is 2025, while the sum is 26.
The spelling of 10353135311 in words is "ten billion, three hundred fifty-three million, one hundred thirty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •