Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1111011010100101110 |
3 | 100120010020201021200021 |
4 | 1131020201323110232 |
5 | 3114300240213402 |
6 | 113535002352354 |
7 | 10140056222500 |
oct | 1351041732456 |
9 | 316106637607 |
10 | 100001101102 |
11 | 39457018401 |
12 | 1746a1bb6ba |
13 | 9578b06996 |
14 | 4ba9269d70 |
15 | 29043a5d37 |
hex | 174887b52e |
100001101102 has 12 divisors (see below), whose sum is σ = 174491717400. Its totient is φ = 42857614716.
The previous prime is 100001101097. The next prime is 100001101133. The reversal of 100001101102 is 201101100001.
It is a super-2 number, since 2×1000011011022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 510209602 + ... + 510209797.
It is an arithmetic number, because the mean of its divisors is an integer number (14540976450).
Almost surely, 2100001101102 is an apocalyptic number.
100001101102 is a deficient number, since it is larger than the sum of its proper divisors (74490616298).
100001101102 is a wasteful number, since it uses less digits than its factorization.
100001101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020419415 (or 1020419408 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100001101102 its reverse (201101100001), we get a palindrome (301102201103).
The spelling of 100001101102 in words is "one hundred billion, one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •