Base | Representation |
---|---|
bin | 10100100011001001… |
… | …11011011000100111 |
3 | 1001110212020111001112 |
4 | 22101210323120213 |
5 | 140043232430320 |
6 | 5022420415235 |
7 | 540251045663 |
oct | 122144733047 |
9 | 31425214045 |
10 | 11032311335 |
11 | 47514a7881 |
12 | 217a84751b |
13 | 106a82b696 |
14 | 7692c18a3 |
15 | 448822ec5 |
hex | 29193b627 |
11032311335 has 16 divisors (see below), whose sum is σ = 13939737600. Its totient is φ = 8358818976.
The previous prime is 11032311319. The next prime is 11032311337. The reversal of 11032311335 is 53311323011.
11032311335 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11032311335 - 24 = 11032311319 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11032311335.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11032311337) 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, 338486 + ... + 369644.
It is an arithmetic number, because the mean of its divisors is an integer number (871233600).
Almost surely, 211032311335 is an apocalyptic number.
11032311335 is a deficient number, since it is larger than the sum of its proper divisors (2907426265).
11032311335 is a wasteful number, since it uses less digits than its factorization.
11032311335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34910.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 11032311335 its reverse (53311323011), we get a palindrome (64343634346).
The spelling of 11032311335 in words is "eleven billion, thirty-two million, three hundred eleven thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •