Base | Representation |
---|---|
bin | 10101000011011101… |
… | …01101011111100100 |
3 | 1002011202011201011110 |
4 | 22201232231133210 |
5 | 141122121430312 |
6 | 5105341105020 |
7 | 550051363305 |
oct | 124156553744 |
9 | 32152151143 |
10 | 11303311332 |
11 | 4880474115 |
12 | 2235558170 |
13 | 10b1a14701 |
14 | 7932a67ac |
15 | 46250443c |
hex | 2a1bad7e4 |
11303311332 has 24 divisors (see below), whose sum is σ = 26821418400. Its totient is φ = 3703909696.
The previous prime is 11303311309. The next prime is 11303311343. The reversal of 11303311332 is 23311330311.
It is a super-2 number, since 2×113033113322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11303311299 and 11303311308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7981857 + ... + 7983272.
It is an arithmetic number, because the mean of its divisors is an integer number (1117559100).
Almost surely, 211303311332 is an apocalyptic number.
11303311332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11303311332 is an abundant number, since it is smaller than the sum of its proper divisors (15518107068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11303311332 is a wasteful number, since it uses less digits than its factorization.
11303311332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15965195 (or 15965193 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11303311332 its reverse (23311330311), we get a palindrome (34614641643).
The spelling of 11303311332 in words is "eleven billion, three hundred three million, three hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •