Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …001000000100000110000101 |
3 | 111010002212022120002022010220 |
4 | 112233111211020010012011 |
5 | 101102031000041200401 |
6 | 552411544145534553 |
7 | 30031325165451453 |
oct | 2657254510040605 |
9 | 433085276068126 |
10 | 100010010100101 |
11 | 2995900949a582 |
12 | b27273a044459 |
13 | 43a5b98c5b6ba |
14 | 1a9a7204439d3 |
15 | b867534c5336 |
hex | 5af565204185 |
100010010100101 has 8 divisors (see below), whose sum is σ = 133347063059424. Its totient is φ = 66673148603760.
The previous prime is 100010010100043. The next prime is 100010010100141. The reversal of 100010010100101 is 101001010010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100010010100101 - 215 = 100010010067333 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100010010100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010010100141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46642470 + ... + 48739511.
It is an arithmetic number, because the mean of its divisors is an integer number (16668382882428).
Almost surely, 2100010010100101 is an apocalyptic number.
It is an amenable number.
100010010100101 is a deficient number, since it is larger than the sum of its proper divisors (33337052959323).
100010010100101 is an equidigital number, since it uses as much as digits as its factorization.
100010010100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95731491.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100010010100101 its reverse (101001010010001), we get a palindrome (201011020110102).
The spelling of 100010010100101 in words is "one hundred trillion, ten billion, ten million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •