Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0010000011011000001000 |
3 | 1110000111120110000111212100 |
4 | 2200113023302003120020 |
5 | 2421022440030310440 |
6 | 35234304523313400 |
7 | 2215112056361256 |
oct | 240271362033010 |
9 | 43014513014770 |
10 | 11020010010120 |
11 | 35696183a5761 |
12 | 129b90307b860 |
13 | 61c24abc5027 |
14 | 2a152ad055d6 |
15 | 1419c8251230 |
hex | a05cbc83608 |
11020010010120 has 96 divisors (see below), whose sum is σ = 36422067052800. Its totient is φ = 2888861375616.
The previous prime is 11020010010091. The next prime is 11020010010143. The reversal of 11020010010120 is 2101001002011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 23 ways as a sum of consecutive naturals, for example, 259395192 + ... + 259437671.
It is an arithmetic number, because the mean of its divisors is an integer number (379396531800).
Almost surely, 211020010010120 is an apocalyptic number.
11020010010120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020010010120 is an abundant number, since it is smaller than the sum of its proper divisors (25402057042680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020010010120 is a wasteful number, since it uses less digits than its factorization.
11020010010120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518832939 (or 518832932 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11020010010120 its reverse (2101001002011), we get a palindrome (13121011012131).
The spelling of 11020010010120 in words is "eleven trillion, twenty billion, ten million, ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •