Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0100110111011010101 |
3 | 201012211001012001020200 |
4 | 2323030202212323111 |
5 | 11243122012320041 |
6 | 232201014051113 |
7 | 20343653554551 |
oct | 2731442467325 |
9 | 635731161220 |
10 | 201000120021 |
11 | 78275367178 |
12 | 32b56649a99 |
13 | 15c5359bb7c |
14 | 9a2ac60861 |
15 | 536617b1b6 |
hex | 2ecc8a6ed5 |
201000120021 has 12 divisors (see below), whose sum is σ = 290354299872. Its totient is φ = 133990483176.
The previous prime is 201000120017. The next prime is 201000120059. The reversal of 201000120021 is 120021000102.
It is not a de Polignac number, because 201000120021 - 22 = 201000120017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201000119985 and 201000120012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000120521) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 665911 + ... + 919476.
It is an arithmetic number, because the mean of its divisors is an integer number (24196191656).
Almost surely, 2201000120021 is an apocalyptic number.
It is an amenable number.
201000120021 is a deficient number, since it is larger than the sum of its proper divisors (89354179851).
201000120021 is a wasteful number, since it uses less digits than its factorization.
201000120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1599480 (or 1599477 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 201000120021 its reverse (120021000102), we get a palindrome (321021120123).
The spelling of 201000120021 in words is "two hundred one billion, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •