Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101111101011100001001100 |
3 | 111020121111221101210221100002 |
4 | 112331233223233223201030 |
5 | 101214241211421011340 |
6 | 554450451022423432 |
7 | 30163005623255630 |
oct | 2675575357534114 |
9 | 436544841727302 |
10 | 101000111110220 |
11 | 2a1aa9a77218a3 |
12 | b3b25b8a31b78 |
13 | 444836744527a |
14 | 1ad2607cdcdc0 |
15 | ba23a0b82715 |
hex | 5bdbebbeb84c |
101000111110220 has 48 divisors (see below), whose sum is σ = 247557719162880. Its totient is φ = 33891830595264.
The previous prime is 101000111110207. The next prime is 101000111110253. The reversal of 101000111110220 is 22011111000101.
It is a super-3 number, since 3×1010001111102203 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7674773900 + ... + 7674787059.
It is an arithmetic number, because the mean of its divisors is an integer number (5157452482560).
Almost surely, 2101000111110220 is an apocalyptic number.
101000111110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101000111110220 is an abundant number, since it is smaller than the sum of its proper divisors (146557608052660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000111110220 is a wasteful number, since it uses less digits than its factorization.
101000111110220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15349561022 (or 15349561020 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101000111110220 its reverse (22011111000101), we get a palindrome (123011222110321).
The spelling of 101000111110220 in words is "one hundred one trillion, one hundred eleven million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •