Base | Representation |
---|---|
bin | 1001010001101110000001… |
… | …0101100011000010010101 |
3 | 1100010010000122211012002021 |
4 | 2110123200111203002111 |
5 | 2314104113110334441 |
6 | 33405453412213141 |
7 | 2101632623240416 |
oct | 224334025430225 |
9 | 40103018735067 |
10 | 10200016105621 |
11 | 32828911a5651 |
12 | 11889b890a1b1 |
13 | 58cb1b8c6344 |
14 | 27397d40380d |
15 | 12a4d49e93d1 |
hex | 946e0563095 |
10200016105621 has 4 divisors (see below), whose sum is σ = 10256999436000. Its totient is φ = 10143032775244.
The previous prime is 10200016105619. The next prime is 10200016105639. The reversal of 10200016105621 is 12650161000201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10200016105621 - 21 = 10200016105619 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200016105121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28491664921 + ... + 28491665278.
It is an arithmetic number, because the mean of its divisors is an integer number (2564249859000).
Almost surely, 210200016105621 is an apocalyptic number.
It is an amenable number.
10200016105621 is a deficient number, since it is larger than the sum of its proper divisors (56983330379).
10200016105621 is an equidigital number, since it uses as much as digits as its factorization.
10200016105621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56983330378.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 10200016105621 its reverse (12650161000201), we get a palindrome (22850177105822).
The spelling of 10200016105621 in words is "ten trillion, two hundred billion, sixteen million, one hundred five thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •