Base | Representation |
---|---|
bin | 10101010001011011… |
… | …00111111111010000 |
3 | 1002110220121211201220 |
4 | 22220231213333100 |
5 | 141342114422102 |
6 | 5125124125040 |
7 | 553003240413 |
oct | 125055477720 |
9 | 32426554656 |
10 | 11420467152 |
11 | 4930613006 |
12 | 2268836780 |
13 | 1100083b93 |
14 | 7a4a81b7a |
15 | 46c9471bc |
hex | 2a8b67fd0 |
11420467152 has 40 divisors (see below), whose sum is σ = 29773555680. Its totient is φ = 3771895680.
The previous prime is 11420467151. The next prime is 11420467169. The reversal of 11420467152 is 25176402411.
It is a super-2 number, since 2×114204671522 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11420467151) by changing a digit.
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, 1086174 + ... + 1096637.
It is an arithmetic number, because the mean of its divisors is an integer number (744338892).
Almost surely, 211420467152 is an apocalyptic number.
11420467152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11420467152 is an abundant number, since it is smaller than the sum of its proper divisors (18353088528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11420467152 is a wasteful number, since it uses less digits than its factorization.
11420467152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2182931 (or 2182925 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 33.
Adding to 11420467152 its reverse (25176402411), we get a palindrome (36596869563).
The spelling of 11420467152 in words is "eleven billion, four hundred twenty million, four hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •