Base | Representation |
---|---|
bin | 10110101111001100011100… |
… | …011101101100111110011101 |
3 | 111010001220222221201112021210 |
4 | 112233030130131230332131 |
5 | 101101400402440214323 |
6 | 552403242545015033 |
7 | 30030530130364200 |
oct | 2657143435547635 |
9 | 433056887645253 |
10 | 100000201101213 |
11 | 29954935581526 |
12 | b270861024479 |
13 | 43a4c949c754a |
14 | 1a9a06d7dd937 |
15 | b8637c295293 |
hex | 5af31c76cf9d |
100000201101213 has 24 divisors (see below), whose sum is σ = 155112298106880. Its totient is φ = 57139307971200.
The previous prime is 100000201101161. The next prime is 100000201101259. The reversal of 100000201101213 is 312101102000001.
It is not a de Polignac number, because 100000201101213 - 217 = 100000200970141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000201101613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19508893 + ... + 24095586.
It is an arithmetic number, because the mean of its divisors is an integer number (6463012421120).
Almost surely, 2100000201101213 is an apocalyptic number.
It is an amenable number.
100000201101213 is a deficient number, since it is larger than the sum of its proper divisors (55112097005667).
100000201101213 is a wasteful number, since it uses less digits than its factorization.
100000201101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43620097 (or 43620090 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 100000201101213 its reverse (312101102000001), we get a palindrome (412101303101214).
The spelling of 100000201101213 in words is "one hundred trillion, two hundred one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •