Base | Representation |
---|---|
bin | 111100111100100… |
… | …0110100011111101 |
3 | 12021112001101101101 |
4 | 1321321012203331 |
5 | 13142010342341 |
6 | 534531413101 |
7 | 101451213520 |
oct | 17171064375 |
9 | 5245041341 |
10 | 2045012221 |
11 | 95a3a0a4a |
12 | 490a54191 |
13 | 2678a7405 |
14 | 155854bb7 |
15 | be804831 |
hex | 79e468fd |
2045012221 has 4 divisors (see below), whose sum is σ = 2337156832. Its totient is φ = 1752867612.
The previous prime is 2045012173. The next prime is 2045012231. The reversal of 2045012221 is 1222105402.
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 2045012221 - 227 = 1910794493 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 (2045012231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146072295 + ... + 146072308.
It is an arithmetic number, because the mean of its divisors is an integer number (584289208).
Almost surely, 22045012221 is an apocalyptic number.
It is an amenable number.
2045012221 is a deficient number, since it is larger than the sum of its proper divisors (292144611).
2045012221 is an equidigital number, since it uses as much as digits as its factorization.
2045012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292144610.
The product of its (nonzero) digits is 320, while the sum is 19.
The square root of 2045012221 is about 45221.8113414312. The cubic root of 2045012221 is about 1269.3029884773.
Adding to 2045012221 its reverse (1222105402), we get a palindrome (3267117623).
The spelling of 2045012221 in words is "two billion, forty-five million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •