Base | Representation |
---|---|
bin | 1011110000111101010… |
… | …0010010100100100101 |
3 | 201022201010021012110222 |
4 | 2330033110102210211 |
5 | 11302420313040401 |
6 | 232504114254125 |
7 | 20413506252056 |
oct | 2741724224445 |
9 | 638633235428 |
10 | 202120440101 |
11 | 7879a7a0238 |
12 | 33209887345 |
13 | 160a1715868 |
14 | 9ad596c72d |
15 | 53ce6c7c1b |
hex | 2f0f512925 |
202120440101 has 8 divisors (see below), whose sum is σ = 214472110464. Its totient is φ = 189820128960.
The previous prime is 202120440097. The next prime is 202120440103. The reversal of 202120440101 is 101044021202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202120440101 - 22 = 202120440097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 202120440101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202120440103) 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, 12831695 + ... + 12847436.
It is an arithmetic number, because the mean of its divisors is an integer number (26809013808).
Almost surely, 2202120440101 is an apocalyptic number.
It is an amenable number.
202120440101 is a deficient number, since it is larger than the sum of its proper divisors (12351670363).
202120440101 is a wasteful number, since it uses less digits than its factorization.
202120440101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25679611.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202120440101 its reverse (101044021202), we get a palindrome (303164461303).
The spelling of 202120440101 in words is "two hundred two billion, one hundred twenty million, four hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •