Base | Representation |
---|---|
bin | 1001010001110010011011… |
… | …1010100011010001001101 |
3 | 1100010020002011220222022211 |
4 | 2110130212322203101031 |
5 | 2314114024223223041 |
6 | 33410211111510421 |
7 | 2102004152045641 |
oct | 224344672432115 |
9 | 40106064828284 |
10 | 10201200211021 |
11 | 3283339635556 |
12 | 1189089388411 |
13 | 58cc7a013c21 |
14 | 273a52796c21 |
15 | 12a553945481 |
hex | 94726ea344d |
10201200211021 has 8 divisors (see below), whose sum is σ = 10249185564288. Its totient is φ = 10153261608000.
The previous prime is 10201200211009. The next prime is 10201200211031. The reversal of 10201200211021 is 12011200210201.
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 10201200211021 - 213 = 10201200202829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201200210992 and 10201200211010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201200211001) 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, 11250085 + ... + 12122986.
It is an arithmetic number, because the mean of its divisors is an integer number (1281148195536).
Almost surely, 210201200211021 is an apocalyptic number.
It is an amenable number.
10201200211021 is a deficient number, since it is larger than the sum of its proper divisors (47985353267).
10201200211021 is a wasteful number, since it uses less digits than its factorization.
10201200211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23375123.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10201200211021 its reverse (12011200210201), we get a palindrome (22212400421222).
The spelling of 10201200211021 in words is "ten trillion, two hundred one billion, two hundred million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •