Base | Representation |
---|---|
bin | 1010000110110000000100… |
… | …1111011001110110100100 |
3 | 1110100012200202011220211210 |
4 | 2201230001033121312210 |
5 | 2424021013402210040 |
6 | 35344211444031420 |
7 | 2224515305656530 |
oct | 241540117316644 |
9 | 43305622156753 |
10 | 11111101210020 |
11 | 35a4211a70449 |
12 | 12b54a5392570 |
13 | 627a06b06606 |
14 | 2a5accad0bc0 |
15 | 14405a2c6480 |
hex | a1b013d9da4 |
11111101210020 has 96 divisors (see below), whose sum is σ = 35557659244800. Its totient is φ = 2539527750144.
The previous prime is 11111101210019. The next prime is 11111101210061. The reversal of 11111101210020 is 2001210111111.
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 = 11111101209978 and 11111101210005.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6282186 + ... + 7854174.
It is an arithmetic number, because the mean of its divisors is an integer number (370392283800).
Almost surely, 211111101210020 is an apocalyptic number.
11111101210020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11111101210020 is an abundant number, since it is smaller than the sum of its proper divisors (24446558034780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111101210020 is a wasteful number, since it uses less digits than its factorization.
11111101210020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1588837 (or 1588835 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11111101210020 its reverse (2001210111111), we get a palindrome (13112311321131).
The spelling of 11111101210020 in words is "eleven trillion, one hundred eleven billion, one hundred one million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •