Base | Representation |
---|---|
bin | 10101001010101100… |
… | …10000100100111111 |
3 | 1002022222101112111111 |
4 | 22211112100210333 |
5 | 141233141312203 |
6 | 5115350102451 |
7 | 551416331242 |
oct | 124526204477 |
9 | 32288345444 |
10 | 11364010303 |
11 | 4901762158 |
12 | 225194aa27 |
13 | 10c1477869 |
14 | 79b387259 |
15 | 4679e426d |
hex | 2a559093f |
11364010303 has 8 divisors (see below), whose sum is σ = 11660576256. Its totient is φ = 11068368000.
The previous prime is 11364010283. The next prime is 11364010327. The reversal of 11364010303 is 30301046311.
It is a happy number.
11364010303 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 not a de Polignac number, because 11364010303 - 217 = 11363879231 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 (11364010393) 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, 205951 + ... + 255232.
It is an arithmetic number, because the mean of its divisors is an integer number (1457572032).
Almost surely, 211364010303 is an apocalyptic number.
11364010303 is a deficient number, since it is larger than the sum of its proper divisors (296565953).
11364010303 is an equidigital number, since it uses as much as digits as its factorization.
11364010303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461825.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11364010303 its reverse (30301046311), we get a palindrome (41665056614).
The spelling of 11364010303 in words is "eleven billion, three hundred sixty-four million, ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •