Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …010100010111011110111000 |
3 | 111021000010102112202220110220 |
4 | 112333113003110113132320 |
5 | 101223101014103330240 |
6 | 555013444330540040 |
7 | 30204015236332602 |
oct | 2677270324273670 |
9 | 437003375686426 |
10 | 101111102011320 |
11 | 2a242a83140635 |
12 | b410013597620 |
13 | 445597501498b |
14 | 1ad7b36942172 |
15 | ba51e9c605d0 |
hex | 5bf5c35177b8 |
101111102011320 has 64 divisors (see below), whose sum is σ = 306741545460000. Its totient is φ = 26660005920768.
The previous prime is 101111102011279. The next prime is 101111102011363. The reversal of 101111102011320 is 23110201111101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101111102011320.
It is a congruent number.
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, 4733655145 + ... + 4733676504.
Almost surely, 2101111102011320 is an apocalyptic number.
101111102011320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101111102011320 is an abundant number, since it is smaller than the sum of its proper divisors (205630443448680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111102011320 is a wasteful number, since it uses less digits than its factorization.
101111102011320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9467331752 (or 9467331748 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101111102011320 its reverse (23110201111101), we get a palindrome (124221303122421).
The spelling of 101111102011320 in words is "one hundred one trillion, one hundred eleven billion, one hundred two million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •