Base | Representation |
---|---|
bin | 10101000011011011… |
… | …11010001100100110 |
3 | 1002011201210000221121 |
4 | 22201231322030212 |
5 | 141122043214342 |
6 | 5105332404154 |
7 | 550046526610 |
oct | 124155721446 |
9 | 32151700847 |
10 | 11303101222 |
11 | 4880340276 |
12 | 223547665a |
13 | 10b196cb9a |
14 | 79324ddb0 |
15 | 4624b2067 |
hex | 2a1b7a326 |
11303101222 has 8 divisors (see below), whose sum is σ = 19376744976. Its totient is φ = 4844186232.
The previous prime is 11303101207. The next prime is 11303101237. The reversal of 11303101222 is 22210130311.
11303101222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11303101207) and next prime (11303101237).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11303101196 and 11303101205.
It is a congruent number.
It is an unprimeable number.
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, 403682173 + ... + 403682200.
It is an arithmetic number, because the mean of its divisors is an integer number (2422093122).
Almost surely, 211303101222 is an apocalyptic number.
11303101222 is a deficient number, since it is larger than the sum of its proper divisors (8073643754).
11303101222 is an equidigital number, since it uses as much as digits as its factorization.
11303101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807364382.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11303101222 its reverse (22210130311), we get a palindrome (33513231533).
The spelling of 11303101222 in words is "eleven billion, three hundred three million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •