Base | Representation |
---|---|
bin | 111100011110010… |
… | …0111100011010001 |
3 | 12020102012211111201 |
4 | 1320330213203101 |
5 | 13123431002221 |
6 | 533203511201 |
7 | 101166355225 |
oct | 17074474321 |
9 | 5212184451 |
10 | 2029156561 |
11 | 9514513a3 |
12 | 487688501 |
13 | 264515473 |
14 | 1536c8785 |
15 | bd221891 |
hex | 78f278d1 |
2029156561 has 6 divisors (see below), whose sum is σ = 2032227330. Its totient is φ = 2026089648.
The previous prime is 2029156517. The next prime is 2029156583. The reversal of 2029156561 is 1656519202.
It can be written as a sum of positive squares in only one way, i.e., 2017806400 + 11350161 = 44920^2 + 3369^2 .
It is not a de Polignac number, because 2029156561 - 211 = 2029154513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2029156561.
It is not an unprimeable number, because it can be changed into a prime (2029156511) 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 5 ways as a sum of consecutive naturals, for example, 1260325 + ... + 1261933.
It is an arithmetic number, because the mean of its divisors is an integer number (338704555).
Almost surely, 22029156561 is an apocalyptic number.
It is an amenable number.
2029156561 is a deficient number, since it is larger than the sum of its proper divisors (3070769).
2029156561 is an frugal number, since it uses more digits than its factorization.
2029156561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3855 (or 2732 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 2029156561 is about 45046.1603358155. The cubic root of 2029156561 is about 1266.0140308844.
The spelling of 2029156561 in words is "two billion, twenty-nine million, one hundred fifty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •