Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0101010101100101000000 |
3 | 1022210121112000100211021020 |
4 | 2103020230211111211000 |
5 | 2311130013324000000 |
6 | 33300550425025440 |
7 | 2062334336304300 |
oct | 223105445254500 |
9 | 38717460324236 |
10 | 10111101000000 |
11 | 3249103a11790 |
12 | 1173723325280 |
13 | 58461b796300 |
14 | 26d546631600 |
15 | 12802da1cba0 |
hex | 9322c955940 |
10111101000000 has 3528 divisors, whose sum is σ = 47193151544928. Its totient is φ = 1886976000000.
The previous prime is 10111100999971. The next prime is 10111101000001. The reversal of 10111101000000 is 10111101.
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 a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111101000001) by changing a digit.
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 503 ways as a sum of consecutive naturals, for example, 273272999982 + ... + 273273000018.
Almost surely, 210111101000000 is an apocalyptic number.
10111101000000 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 10111101000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23596575772464).
10111101000000 is an abundant number, since it is smaller than the sum of its proper divisors (37082050544928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111101000000 is an equidigital number, since it uses as much as digits as its factorization.
10111101000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 78 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10111101000000 its reverse (10111101), we get a palindrome (10111111111101).
10111101000000 divided by its reverse (10111101) gives a 6-th power (1000000 = 106).
It can be divided in two parts, 1011 and 1101000000, that added together give a palindrome (1101001011).
The spelling of 10111101000000 in words is "ten trillion, one hundred eleven billion, one hundred one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •