Base | Representation |
---|---|
bin | 10101000101101010… |
… | …00101001110111010 |
3 | 1002020000212221010110 |
4 | 22202311011032322 |
5 | 141141332234100 |
6 | 5111240325150 |
7 | 550364234466 |
oct | 124265051672 |
9 | 32200787113 |
10 | 11321758650 |
11 | 488a923934 |
12 | 223b7737b6 |
13 | 10b57a3197 |
14 | 7959094a6 |
15 | 463e4a250 |
hex | 2a2d453ba |
11321758650 has 48 divisors (see below), whose sum is σ = 28122003648. Its totient is φ = 3014400000.
The previous prime is 11321758621. The next prime is 11321758697. The reversal of 11321758650 is 5685712311.
11321758650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11321758599 and 11321758608.
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 23 ways as a sum of consecutive naturals, for example, 37275 + ... + 155025.
It is an arithmetic number, because the mean of its divisors is an integer number (585875076).
Almost surely, 211321758650 is an apocalyptic number.
11321758650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11321758650 is an abundant number, since it is smaller than the sum of its proper divisors (16800244998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321758650 is a wasteful number, since it uses less digits than its factorization.
11321758650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118407 (or 118402 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 39.
The spelling of 11321758650 in words is "eleven billion, three hundred twenty-one million, seven hundred fifty-eight thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •