Base | Representation |
---|---|
bin | 1001010001110010000011… |
… | …1101000010100001010101 |
3 | 1100010012211012201220000201 |
4 | 2110130200331002201111 |
5 | 2314113323122400041 |
6 | 33410153140140501 |
7 | 2102001526006453 |
oct | 224344075024125 |
9 | 40105735656021 |
10 | 10201100200021 |
11 | 3283298136835 |
12 | 118905b997731 |
13 | 58cc62398413 |
14 | 273a433a19d3 |
15 | 12a549c8c631 |
hex | 94720f42855 |
10201100200021 has 8 divisors (see below), whose sum is σ = 10324073067840. Its totient is φ = 10078128952512.
The previous prime is 10201100199977. The next prime is 10201100200087. The reversal of 10201100200021 is 12000200110201.
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 10201100200021 - 29 = 10201100199509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201100199980 and 10201100200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201100200091) 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, 16477245 + ... + 17085133.
It is an arithmetic number, because the mean of its divisors is an integer number (1290509133480).
Almost surely, 210201100200021 is an apocalyptic number.
It is an amenable number.
10201100200021 is a deficient number, since it is larger than the sum of its proper divisors (122972867819).
10201100200021 is an equidigital number, since it uses as much as digits as its factorization.
10201100200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 810155.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10201100200021 its reverse (12000200110201), we get a palindrome (22201300310222).
The spelling of 10201100200021 in words is "ten trillion, two hundred one billion, one hundred million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •