Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …00010100001011101001 |
3 | 10120112222122020002022121 |
4 | 32230220230110023221 |
5 | 113021440001121301 |
6 | 2051553153351241 |
7 | 132653512343614 |
oct | 16545054241351 |
9 | 3515878202277 |
10 | 1010000020201 |
11 | 35a37a7540a7 |
12 | 1438b2b68521 |
13 | 7431cc92263 |
14 | 36c545b317b |
15 | 1b41462a3a1 |
hex | eb28b142e9 |
1010000020201 has 4 divisors (see below), whose sum is σ = 1010100099652. Its totient is φ = 1009899940752.
The previous prime is 1010000020193. The next prime is 1010000020223. The reversal of 1010000020201 is 1020200000101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 637161554176 + 372838466025 = 798224^2 + 610605^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010000020201 - 23 = 1010000020193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010000020231) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 50024586 + ... + 50044771.
It is an arithmetic number, because the mean of its divisors is an integer number (252525024913).
Almost surely, 21010000020201 is an apocalyptic number.
It is an amenable number.
1010000020201 is a deficient number, since it is larger than the sum of its proper divisors (100079451).
1010000020201 is a wasteful number, since it uses less digits than its factorization.
1010000020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100079450.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1010000020201 its reverse (1020200000101), we get a palindrome (2030200020302).
The spelling of 1010000020201 in words is "one trillion, ten billion, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •