Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10010010110100000 |
3 | 222002122211010010001 |
4 | 21122222302112200 |
5 | 131201420202240 |
6 | 4351151545344 |
7 | 505363635406 |
oct | 113252622640 |
9 | 28078733101 |
10 | 10111100320 |
11 | 43194a8362 |
12 | 1b6222b254 |
13 | c51a195c9 |
14 | 6bcc03476 |
15 | 3e2a0689a |
hex | 25aab25a0 |
10111100320 has 24 divisors (see below), whose sum is σ = 23887474884. Its totient is φ = 4044440064.
The previous prime is 10111100303. The next prime is 10111100333. The reversal of 10111100320 is 2300111101.
It can be written as a sum of positive squares in 2 ways, for example, as 8517813264 + 1593287056 = 92292^2 + 39916^2 .
It is a super-2 number, since 2×101111003202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10111100297 and 10111100306.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31597029 + ... + 31597348.
Almost surely, 210111100320 is an apocalyptic number.
10111100320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111100320 is an abundant number, since it is smaller than the sum of its proper divisors (13776374564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111100320 is an equidigital number, since it uses as much as digits as its factorization.
10111100320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63194392 (or 63194384 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10111100320 its reverse (2300111101), we get a palindrome (12411211421).
The spelling of 10111100320 in words is "ten billion, one hundred eleven million, one hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •