Base | Representation |
---|---|
bin | 101111000010101000… |
… | …0110010110111101001 |
3 | 100122202020222201220200 |
4 | 1132011100302313221 |
5 | 3123342111121301 |
6 | 114224041342413 |
7 | 10204241001222 |
oct | 1360520626751 |
9 | 318666881820 |
10 | 101020020201 |
11 | 3992a193401 |
12 | 176b3497a09 |
13 | 96abc392a9 |
14 | 4c64700249 |
15 | 2963a72c86 |
hex | 1785432de9 |
101020020201 has 12 divisors (see below), whose sum is σ = 148670973828. Its totient is φ = 66075987744.
The previous prime is 101020020197. The next prime is 101020020259. The reversal of 101020020201 is 102020020101.
It can be written as a sum of positive squares in 2 ways, for example, as 77812544601 + 23207475600 = 278949^2 + 152340^2 .
It is not a de Polignac number, because 101020020201 - 22 = 101020020197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101020020281) 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 11 ways as a sum of consecutive naturals, for example, 105890530 + ... + 105891483.
It is an arithmetic number, because the mean of its divisors is an integer number (12389247819).
Almost surely, 2101020020201 is an apocalyptic number.
It is an amenable number.
101020020201 is a deficient number, since it is larger than the sum of its proper divisors (47650953627).
101020020201 is a wasteful number, since it uses less digits than its factorization.
101020020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211782072 (or 211782069 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 101020020201 its reverse (102020020101), we get a palindrome (203040040302).
The spelling of 101020020201 in words is "one hundred one billion, twenty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •