Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …010110011101010110010 |
3 | 10220011021221221120122000 |
4 | 100000131022303222302 |
5 | 121010300224000424 |
6 | 2201200010554430 |
7 | 142321023141222 |
oct | 20003512635262 |
9 | 3804257846560 |
10 | 1100001000114 |
11 | 394564984435 |
12 | 159230138a16 |
13 | 7c964068563 |
14 | 3b351688082 |
15 | 1d930aec3c9 |
hex | 1001d2b3ab2 |
1100001000114 has 32 divisors (see below), whose sum is σ = 2444489797440. Its totient is φ = 366660530496.
The previous prime is 1100001000113. The next prime is 1100001000149. The reversal of 1100001000114 is 4110001000011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100001000096 and 1100001000105.
It is not an unprimeable number, because it can be changed into a prime (1100001000113) 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 15 ways as a sum of consecutive naturals, for example, 3662922 + ... + 3951834.
It is an arithmetic number, because the mean of its divisors is an integer number (76390306170).
Almost surely, 21100001000114 is an apocalyptic number.
1100001000114 is an abundant number, since it is smaller than the sum of its proper divisors (1344488797326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100001000114 is a wasteful number, since it uses less digits than its factorization.
1100001000114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359431 (or 359425 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100001000114 its reverse (4110001000011), we get a palindrome (5210002000125).
The spelling of 1100001000114 in words is "one trillion, one hundred billion, one million, one hundred fourteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •