Base | Representation |
---|---|
bin | 10100100000101110… |
… | …11101001000010000 |
3 | 1001102110000200022210 |
4 | 22100113131020100 |
5 | 140023033033240 |
6 | 5020413232120 |
7 | 536613322014 |
oct | 122027351020 |
9 | 31373020283 |
10 | 11012002320 |
11 | 4740a96370 |
12 | 2173a92640 |
13 | 106656a707 |
14 | 766716544 |
15 | 446b60780 |
hex | 2905dd210 |
11012002320 has 80 divisors (see below), whose sum is σ = 37240598592. Its totient is φ = 2669575680.
The previous prime is 11012002303. The next prime is 11012002321. The reversal of 11012002320 is 2320021011.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11012002296 and 11012002305.
It is not an unprimeable number, because it can be changed into a prime (11012002321) by changing a digit.
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, 2082967 + ... + 2088246.
Almost surely, 211012002320 is an apocalyptic number.
11012002320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012002320 is an abundant number, since it is smaller than the sum of its proper divisors (26228596272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012002320 is a wasteful number, since it uses less digits than its factorization.
11012002320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4171240 (or 4171234 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11012002320 its reverse (2320021011), we get a palindrome (13332023331).
The spelling of 11012002320 in words is "eleven billion, twelve million, two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •