Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …001100101100011100000001 |
3 | 111021000010102101222201110121 |
4 | 112333113003030230130001 |
5 | 101223101013100000001 |
6 | 555013444215500241 |
7 | 30204015213254650 |
oct | 2677270314543401 |
9 | 437003371881417 |
10 | 101111100000001 |
11 | 2a242a81a97493 |
12 | b410012987681 |
13 | 445597478c350 |
14 | 1ad7b3657b197 |
15 | ba51e99b46a1 |
hex | 5bf5c332c701 |
101111100000001 has 64 divisors (see below), whose sum is σ = 125467138621440. Its totient is φ = 79345389231360.
The previous prime is 101111099999983. The next prime is 101111100000059. The reversal of 101111100000001 is 100000001111101.
It is a happy number.
It is not a de Polignac number, because 101111100000001 - 29 = 101111099999489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a self number, because there is not a number n which added to its sum of digits gives 101111100000001.
It is not an unprimeable number, because it can be changed into a prime (101111100000091) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8395833886 + ... + 8395845928.
It is an arithmetic number, because the mean of its divisors is an integer number (1960424040960).
Almost surely, 2101111100000001 is an apocalyptic number.
It is an amenable number.
101111100000001 is a deficient number, since it is larger than the sum of its proper divisors (24356038621439).
101111100000001 is a wasteful number, since it uses less digits than its factorization.
101111100000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13646.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101111100000001 its reverse (100000001111101), we get a palindrome (201111101111102).
The spelling of 101111100000001 in words is "one hundred one trillion, one hundred eleven billion, one hundred million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •