Base | Representation |
---|---|
bin | 101101101100111110101110… |
… | …100000010110000011010101 |
3 | 222100200201010210101120110112 |
4 | 231230332232200112003111 |
5 | 202321213323130400041 |
6 | 1551255314514532405 |
7 | 60223665152323502 |
oct | 5554765640260325 |
9 | 870621123346415 |
10 | 201003102200021 |
11 | 59055a34063010 |
12 | 1a6638b8297105 |
13 | 8820685172c24 |
14 | 378c8600784a9 |
15 | 1838842d35deb |
hex | b6cfae8160d5 |
201003102200021 has 16 divisors (see below), whose sum is σ = 222476081908608. Its totient is φ = 180066033638400.
The previous prime is 201003102200003. The next prime is 201003102200027. The reversal of 201003102200021 is 120002201300102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201003102200021 - 218 = 201003101937877 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201003102199969 and 201003102200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201003102200027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63011036 + ... + 66124101.
It is an arithmetic number, because the mean of its divisors is an integer number (13904755119288).
Almost surely, 2201003102200021 is an apocalyptic number.
It is an amenable number.
201003102200021 is a deficient number, since it is larger than the sum of its proper divisors (21472979708587).
201003102200021 is a wasteful number, since it uses less digits than its factorization.
201003102200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129137212.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 201003102200021 its reverse (120002201300102), we get a palindrome (321005303500123).
The spelling of 201003102200021 in words is "two hundred one trillion, three billion, one hundred two million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •