Base | Representation |
---|---|
bin | 10100111101001111… |
… | …01000000101011000 |
3 | 1002001002222020120111 |
4 | 22132213220011120 |
5 | 141020241410040 |
6 | 5100234334104 |
7 | 545545651321 |
oct | 123647500530 |
9 | 32032866514 |
10 | 11251122520 |
11 | 4853a68970 |
12 | 221bb8a334 |
13 | 10a3c70c61 |
14 | 78a39d448 |
15 | 45cb45dea |
hex | 29e9e8158 |
11251122520 has 64 divisors (see below), whose sum is σ = 28817130240. Its totient is φ = 3913430400.
The previous prime is 11251122511. The next prime is 11251122521. The reversal of 11251122520 is 2522115211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 11251122491 and 11251122500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11251122521) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 545766 + ... + 566005.
It is an arithmetic number, because the mean of its divisors is an integer number (450267660).
Almost surely, 211251122520 is an apocalyptic number.
11251122520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11251122520 is an abundant number, since it is smaller than the sum of its proper divisors (17566007720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11251122520 is a wasteful number, since it uses less digits than its factorization.
11251122520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1111816 (or 1111812 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 22.
Adding to 11251122520 its reverse (2522115211), we get a palindrome (13773237731).
The spelling of 11251122520 in words is "eleven billion, two hundred fifty-one million, one hundred twenty-two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •