Base | Representation |
---|---|
bin | 111100110011001… |
… | …010011101101001 |
3 | 2122002101122220102 |
4 | 330303022131221 |
5 | 4042112421121 |
6 | 245115035145 |
7 | 34164145412 |
oct | 7463123551 |
9 | 2562348812 |
10 | 1020045161 |
11 | 483875033 |
12 | 24573bab5 |
13 | 133438025 |
14 | 99688809 |
15 | 5e84090b |
hex | 3ccca769 |
1020045161 has 4 divisors (see below), whose sum is σ = 1021386324. Its totient is φ = 1018704000.
The previous prime is 1020045151. The next prime is 1020045163. The reversal of 1020045161 is 1615400201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 217739536 + 802305625 = 14756^2 + 28325^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020045161 - 214 = 1020028777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020045163) 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, 669440 + ... + 670961.
It is an arithmetic number, because the mean of its divisors is an integer number (255346581).
Almost surely, 21020045161 is an apocalyptic number.
It is an amenable number.
1020045161 is a deficient number, since it is larger than the sum of its proper divisors (1341163).
1020045161 is an equidigital number, since it uses as much as digits as its factorization.
1020045161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341162.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 1020045161 is about 31938.1458603971. The cubic root of 1020045161 is about 1006.6375655788.
Adding to 1020045161 its reverse (1615400201), we get a palindrome (2635445362).
The spelling of 1020045161 in words is "one billion, twenty million, forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •