Base | Representation |
---|---|
bin | 10101000101100100… |
… | …10001011001000100 |
3 | 1002012222111111122212 |
4 | 22202302101121010 |
5 | 141141140201040 |
6 | 5111212442552 |
7 | 550355046050 |
oct | 124262213104 |
9 | 32188444585 |
10 | 11321022020 |
11 | 488a470450 |
12 | 223b479458 |
13 | 10b55a5ac9 |
14 | 795796c60 |
15 | 463d51d65 |
hex | 2a2c91644 |
11321022020 has 48 divisors (see below), whose sum is σ = 29640498048. Its totient is φ = 3528629760.
The previous prime is 11321021977. The next prime is 11321022043. The reversal of 11321022020 is 2022012311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 11321021986 and 11321022004.
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 15 ways as a sum of consecutive naturals, for example, 3674117 + ... + 3677196.
It is an arithmetic number, because the mean of its divisors is an integer number (617510376).
Almost surely, 211321022020 is an apocalyptic number.
11321022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11321022020 is an abundant number, since it is smaller than the sum of its proper divisors (18319476028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321022020 is a wasteful number, since it uses less digits than its factorization.
11321022020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7351340 (or 7351338 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11321022020 its reverse (2022012311), we get a palindrome (13343034331).
The spelling of 11321022020 in words is "eleven billion, three hundred twenty-one million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •