Base | Representation |
---|---|
bin | 10101000100100111… |
… | …01110001001000000 |
3 | 1002012102102121210001 |
4 | 22202103232021000 |
5 | 141132112411222 |
6 | 5110325045344 |
7 | 550230012046 |
oct | 124223561100 |
9 | 32172377701 |
10 | 11313013312 |
11 | 48859a0387 |
12 | 2238856854 |
13 | 10b3a30723 |
14 | 7946b0396 |
15 | 4632bde27 |
hex | 2a24ee240 |
11313013312 has 56 divisors (see below), whose sum is σ = 23457139776. Its totient is φ = 5403222528.
The previous prime is 11313013297. The next prime is 11313013321. The reversal of 11313013312 is 21331031311.
It is a self number, because there is not a number n which added to its sum of digits gives 11313013312.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1168363 + ... + 1178005.
It is an arithmetic number, because the mean of its divisors is an integer number (418877496).
Almost surely, 211313013312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11313013312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11728569888).
11313013312 is an abundant number, since it is smaller than the sum of its proper divisors (12144126464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313013312 is an equidigital number, since it uses as much as digits as its factorization.
11313013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10475 (or 10465 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11313013312 its reverse (21331031311), we get a palindrome (32644044623).
The spelling of 11313013312 in words is "eleven billion, three hundred thirteen million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •