Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1110111010000001000 |
3 | 100122222121012002122101 |
4 | 1132022223313100020 |
5 | 3124033404031440 |
6 | 114241051403144 |
7 | 10206424223512 |
oct | 1361253672010 |
9 | 318877162571 |
10 | 101111002120 |
11 | 39976585477 |
12 | 17719a534b4 |
13 | 96c4a4314b |
14 | 4c72824bb2 |
15 | 296ba4569a |
hex | 178aaf7408 |
101111002120 has 64 divisors (see below), whose sum is σ = 235400904000. Its totient is φ = 39040420608.
The previous prime is 101111002117. The next prime is 101111002127. The reversal of 101111002120 is 21200111101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 101111002097 and 101111002106.
It is not an unprimeable number, because it can be changed into a prime (101111002127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6696099 + ... + 6711181.
It is an arithmetic number, because the mean of its divisors is an integer number (3678139125).
Almost surely, 2101111002120 is an apocalyptic number.
101111002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101111002120 is an abundant number, since it is smaller than the sum of its proper divisors (134289901880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111002120 is a wasteful number, since it uses less digits than its factorization.
101111002120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20902 (or 20898 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101111002120 its reverse (21200111101), we get a palindrome (122311113221).
The spelling of 101111002120 in words is "one hundred one billion, one hundred eleven million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •