Base | Representation |
---|---|
bin | 1000000001001100… |
… | …1000101101101111 |
3 | 12120000022100000011 |
4 | 2000103020231233 |
5 | 13402020000304 |
6 | 553331314051 |
7 | 104224643302 |
oct | 20023105557 |
9 | 5500270004 |
10 | 2152500079 |
11 | a05037194 |
12 | 500a4b927 |
13 | 283c401b2 |
14 | 165c34b39 |
15 | c8e87c04 |
hex | 804c8b6f |
2152500079 has 4 divisors (see below), whose sum is σ = 2152607400. Its totient is φ = 2152392760.
The previous prime is 2152500073. The next prime is 2152500109. The reversal of 2152500079 is 9700052512.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2152500079 - 25 = 2152500047 is a prime.
It is a pancake number, because a pancake can be divided into 2152500079 parts by 65612 straight cuts.
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 2152500079.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2152500073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13612 + ... + 67009.
It is an arithmetic number, because the mean of its divisors is an integer number (538151850).
Almost surely, 22152500079 is an apocalyptic number.
2152500079 is a deficient number, since it is larger than the sum of its proper divisors (107321).
2152500079 is an equidigital number, since it uses as much as digits as its factorization.
2152500079 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107320.
The product of its (nonzero) digits is 6300, while the sum is 31.
The square root of 2152500079 is about 46395.0436900322. The cubic root of 2152500079 is about 1291.1629596275.
The spelling of 2152500079 in words is "two billion, one hundred fifty-two million, five hundred thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •