Base | Representation |
---|---|
bin | 10101000011011011… |
… | …01001010110010101 |
3 | 1002011201122112021201 |
4 | 22201231221112111 |
5 | 141122034012323 |
6 | 5105331112501 |
7 | 550046121454 |
oct | 124155512625 |
9 | 32151575251 |
10 | 11303032213 |
11 | 48802a3440 |
12 | 2235442731 |
13 | 10b1947655 |
14 | 793232b9b |
15 | 46249b8ad |
hex | 2a1b69595 |
11303032213 has 8 divisors (see below), whose sum is σ = 12479142816. Its totient is φ = 10151682000.
The previous prime is 11303032193. The next prime is 11303032217. The reversal of 11303032213 is 31223030311.
11303032213 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-11303032213 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 (11303032217) 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, 6189138 + ... + 6190963.
It is an arithmetic number, because the mean of its divisors is an integer number (1559892852).
Almost surely, 211303032213 is an apocalyptic number.
It is an amenable number.
11303032213 is a deficient number, since it is larger than the sum of its proper divisors (1176110603).
11303032213 is a wasteful number, since it uses less digits than its factorization.
11303032213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12380195.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 11303032213 its reverse (31223030311), we get a palindrome (42526062524).
The spelling of 11303032213 in words is "eleven billion, three hundred three million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •