Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …001101000100110110100010 |
3 | 111021000010102102011210122100 |
4 | 112333113003031010312202 |
5 | 101223101013111200002 |
6 | 555013444221551230 |
7 | 30204015214152336 |
oct | 2677270315046642 |
9 | 437003372153570 |
10 | 101111100100002 |
11 | 2a242a82055633 |
12 | b410012a15516 |
13 | 44559747c5a15 |
14 | 1ad7b365a57c6 |
15 | ba51e99d411c |
hex | 5bf5c3344da2 |
101111100100002 has 48 divisors (see below), whose sum is σ = 221940242634240. Its totient is φ = 33263105443776.
The previous prime is 101111100099941. The next prime is 101111100100079. The reversal of 101111100100002 is 200001001111101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11530563 + ... + 18307814.
It is an arithmetic number, because the mean of its divisors is an integer number (4623755054880).
Almost surely, 2101111100100002 is an apocalyptic number.
101111100100002 is an abundant number, since it is smaller than the sum of its proper divisors (120829142534238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111100100002 is a wasteful number, since it uses less digits than its factorization.
101111100100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29840847 (or 29840844 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101111100100002 its reverse (200001001111101), we get a palindrome (301112101211103).
The spelling of 101111100100002 in words is "one hundred one trillion, one hundred eleven billion, one hundred million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •