Base | Representation |
---|---|
bin | 1010000111010010000000… |
… | …1010110001001001101100 |
3 | 1110101002012120000120020020 |
4 | 2201310200022301021230 |
5 | 2424143142231214040 |
6 | 35352315353322140 |
7 | 2225260112416620 |
oct | 241644012611154 |
9 | 43332176016206 |
10 | 11120210023020 |
11 | 35a806672247a |
12 | 12b7207a06350 |
13 | 628828c948a7 |
14 | 2a631474d180 |
15 | 1443dece8cd0 |
hex | a1d202b126c |
11120210023020 has 96 divisors (see below), whose sum is σ = 35585137814016. Its totient is φ = 2541729024000.
The previous prime is 11120210022991. The next prime is 11120210023033. The reversal of 11120210023020 is 2032001202111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47650620 + ... + 47883420.
It is an arithmetic number, because the mean of its divisors is an integer number (370678518896).
Almost surely, 211120210023020 is an apocalyptic number.
11120210023020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120210023020 is an abundant number, since it is smaller than the sum of its proper divisors (24464927790996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120210023020 is a wasteful number, since it uses less digits than its factorization.
11120210023020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346551 (or 346549 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11120210023020 its reverse (2032001202111), we get a palindrome (13152211225131).
The spelling of 11120210023020 in words is "eleven trillion, one hundred twenty billion, two hundred ten million, twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •