Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010010111000000110110101 |
3 | 111010002000101001200202001100 |
4 | 112233031103102320012311 |
5 | 101101404243434310401 |
6 | 552403514125520313 |
7 | 30030562000442253 |
oct | 2657152322700665 |
9 | 433060331622040 |
10 | 100001121010101 |
11 | 29955267871703 |
12 | b270a79113099 |
13 | 43a50b0471a2c |
14 | 1a9a119a5d5d3 |
15 | b863d2e05b86 |
hex | 5af3534b81b5 |
100001121010101 has 12 divisors (see below), whose sum is σ = 148350011348812. Its totient is φ = 64865592006336.
The previous prime is 100001121010057. The next prime is 100001121010151. The reversal of 100001121010101 is 101010121100001.
It can be written as a sum of positive squares in 2 ways, for example, as 58756134215025 + 41244986795076 = 7665255^2 + 6422226^2 .
It is not a de Polignac number, because 100001121010101 - 27 = 100001121009973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001121010151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 150151833016 + ... + 150151833681.
Almost surely, 2100001121010101 is an apocalyptic number.
It is an amenable number.
100001121010101 is a deficient number, since it is larger than the sum of its proper divisors (48348890338711).
100001121010101 is a wasteful number, since it uses less digits than its factorization.
100001121010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300303666740 (or 300303666737 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100001121010101 its reverse (101010121100001), we get a palindrome (201011242110102).
The spelling of 100001121010101 in words is "one hundred trillion, one billion, one hundred twenty-one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.987 sec. • engine limits •