Base | Representation |
---|---|
bin | 1111000111011100000000… |
… | …1001111111100010000101 |
3 | 2011211220021220021000120002 |
4 | 3301313000021333202011 |
5 | 4134302141243010341 |
6 | 55203155210251045 |
7 | 3333534205453031 |
oct | 361670011774205 |
9 | 64756256230502 |
10 | 16620452313221 |
11 | 5328770044669 |
12 | 1a451a3a26a85 |
13 | 9373c0449cb3 |
14 | 4166115891c1 |
15 | 1dc50955d29b |
hex | f1dc027f885 |
16620452313221 has 16 divisors (see below), whose sum is σ = 16893870105600. Its totient is φ = 16348143772800.
The previous prime is 16620452313209. The next prime is 16620452313229. The reversal of 16620452313221 is 12231325402661.
16620452313221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 16620452313221 - 210 = 16620452312197 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 (16620452313229) 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, 143766281 + ... + 143881841.
It is an arithmetic number, because the mean of its divisors is an integer number (1055866881600).
Almost surely, 216620452313221 is an apocalyptic number.
It is an amenable number.
16620452313221 is a deficient number, since it is larger than the sum of its proper divisors (273417792379).
16620452313221 is a wasteful number, since it uses less digits than its factorization.
16620452313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120340.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 16620452313221 its reverse (12231325402661), we get a palindrome (28851777715882).
The spelling of 16620452313221 in words is "sixteen trillion, six hundred twenty billion, four hundred fifty-two million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •