Base | Representation |
---|---|
bin | 111100001111000… |
… | …0111101010001101 |
3 | 12012212011122111112 |
4 | 1320132013222031 |
5 | 13114404132423 |
6 | 532320301405 |
7 | 101041406312 |
oct | 17036075215 |
9 | 5185148445 |
10 | 2021161613 |
11 | 9479906a9 |
12 | 484a71865 |
13 | 262976423 |
14 | 152606d09 |
15 | bc692a78 |
hex | 78787a8d |
2021161613 has 4 divisors (see below), whose sum is σ = 2127538560. Its totient is φ = 1914784668.
The previous prime is 2021161589. The next prime is 2021161619. The reversal of 2021161613 is 3161611202.
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 2021161613 - 28 = 2021161357 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 (2021161619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53188445 + ... + 53188482.
It is an arithmetic number, because the mean of its divisors is an integer number (531884640).
Almost surely, 22021161613 is an apocalyptic number.
It is an amenable number.
2021161613 is a deficient number, since it is larger than the sum of its proper divisors (106376947).
2021161613 is a wasteful number, since it uses less digits than its factorization.
2021161613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106376946.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 2021161613 is about 44957.3310262075. The cubic root of 2021161613 is about 1264.3491291514.
Adding to 2021161613 its reverse (3161611202), we get a palindrome (5182772815).
The spelling of 2021161613 in words is "two billion, twenty-one million, one hundred sixty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •