| Base | Representation |
|---|---|
| bin | 10110111111010110111101… |
| … | …010011000010100001000000 |
| 3 | 111021000010011111200222222220 |
| 4 | 112333112331103002201000 |
| 5 | 101223100312224000000 |
| 6 | 555013430321531040 |
| 7 | 30204012601626135 |
| oct | 2677267523024100 |
| 9 | 437003144628886 |
| 10 | 101111001000000 |
| 11 | 2a242a31119302 |
| 12 | b40bba57a3a80 |
| 13 | 445595a108a74 |
| 14 | 1ad7b2736a58c |
| 15 | ba51e0e5b1a0 |
| hex | 5bf5bd4c2840 |
101111001000000 has 392 divisors, whose sum is σ = 334570867438080. Its totient is φ = 26949100800000.
The previous prime is 101111000999951. The next prime is 101111001000007. The reversal of 101111001000000 is 100111101.
101111001000000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is not an unprimeable number, because it can be changed into a prime (101111001000007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 6716992474 + ... + 6717007526.
Almost surely, 2101111001000000 is an apocalyptic number.
101111001000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101111001000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167285433719040).
101111001000000 is an abundant number, since it is smaller than the sum of its proper divisors (233459866438080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111001000000 is an frugal number, since it uses more digits than its factorization.
101111001000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17337 (or 17302 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101111001000000 its reverse (100111101), we get a palindrome (101111101111101).
The spelling of 101111001000000 in words is "one hundred one trillion, one hundred eleven billion, one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •