Base | Representation |
---|---|
bin | 10100100011100000… |
… | …11100110110101101 |
3 | 1001111001220221122111 |
4 | 22101300130312231 |
5 | 140100021111023 |
6 | 5023005244021 |
7 | 540315526426 |
oct | 122160346655 |
9 | 31431827574 |
10 | 11035332013 |
11 | 4753180302 |
12 | 217b863611 |
13 | 106b348574 |
14 | 76986a64d |
15 | 448c1d00d |
hex | 291c1cdad |
11035332013 has 8 divisors (see below), whose sum is σ = 11285671680. Its totient is φ = 10787758800.
The previous prime is 11035332001. The next prime is 11035332037. The reversal of 11035332013 is 31023353011.
It is a happy number.
11035332013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11035332013 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 (11035332613) 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 7 ways as a sum of consecutive naturals, for example, 683545 + ... + 699502.
It is an arithmetic number, because the mean of its divisors is an integer number (1410708960).
Almost surely, 211035332013 is an apocalyptic number.
It is an amenable number.
11035332013 is a deficient number, since it is larger than the sum of its proper divisors (250339667).
11035332013 is a wasteful number, since it uses less digits than its factorization.
11035332013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1383227.
The product of its (nonzero) digits is 810, while the sum is 22.
Adding to 11035332013 its reverse (31023353011), we get a palindrome (42058685024).
The spelling of 11035332013 in words is "eleven billion, thirty-five million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •