Base | Representation |
---|---|
bin | 1011000100000111… |
… | …1000110100101101 |
3 | 21122222200210021221 |
4 | 2301001320310231 |
5 | 22040313442000 |
6 | 1210414423341 |
7 | 133413053152 |
oct | 26101706455 |
9 | 7588623257 |
10 | 2970062125 |
11 | 12945826a8 |
12 | 6aa801b51 |
13 | 384431914 |
14 | 202652229 |
15 | 125b2d61a |
hex | b1078d2d |
2970062125 has 8 divisors (see below), whose sum is σ = 3706637688. Its totient is φ = 2376049600.
The previous prime is 2970062107. The next prime is 2970062143. The reversal of 2970062125 is 5212600792.
It is an interprime number because it is at equal distance from previous prime (2970062107) and next prime (2970062143).
It can be written as a sum of positive squares in 4 ways, for example, as 59567524 + 2910494601 = 7718^2 + 53949^2 .
It is not a de Polignac number, because 2970062125 - 25 = 2970062093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11880124 + ... + 11880373.
It is an arithmetic number, because the mean of its divisors is an integer number (463329711).
Almost surely, 22970062125 is an apocalyptic number.
2970062125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2970062125 is a deficient number, since it is larger than the sum of its proper divisors (736575563).
2970062125 is an equidigital number, since it uses as much as digits as its factorization.
2970062125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23760512 (or 23760502 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 2970062125 is about 54498.2763488902. The cubic root of 2970062125 is about 1437.4359795055.
The spelling of 2970062125 in words is "two billion, nine hundred seventy million, sixty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •