Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …011110111100101010001001 |
3 | 111010001220110221111122211111 |
4 | 112233030100132330222021 |
5 | 101101400000011213001 |
6 | 552403211004530321 |
7 | 30030522140042560 |
oct | 2657142036745211 |
9 | 433056427448744 |
10 | 100000000101001 |
11 | 29954842076050 |
12 | b2708058509a1 |
13 | 43a4c6217cc00 |
14 | 1a9a050c3abd7 |
15 | b863697de851 |
hex | 5af3107bca89 |
100000000101001 has 96 divisors (see below), whose sum is σ = 140738252046336. Its totient is φ = 68918597280000.
The previous prime is 100000000100953. The next prime is 100000000101041. The reversal of 100000000101001 is 100101000000001.
It is not a de Polignac number, because 100000000101001 - 29 = 100000000100489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100000000101041) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 39516520 + ... + 41970886.
It is an arithmetic number, because the mean of its divisors is an integer number (1466023458816).
Almost surely, 2100000000101001 is an apocalyptic number.
100000000101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100000000101001 is a deficient number, since it is larger than the sum of its proper divisors (40738251945335).
100000000101001 is a wasteful number, since it uses less digits than its factorization.
100000000101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2454543 (or 2454530 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 100000000101001 its reverse (100101000000001), we get a palindrome (200101000101002).
It can be divided in two parts, 100000000 and 101001, that added together give a palindrome (100101001).
The spelling of 100000000101001 in words is "one hundred trillion, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •