Base | Representation |
---|---|
bin | 111101001011110… |
… | …0100010100001111 |
3 | 12022002002010101100 |
4 | 1322113210110033 |
5 | 13201031422130 |
6 | 535414514143 |
7 | 101606125056 |
oct | 17227442417 |
9 | 5262063340 |
10 | 2052998415 |
11 | 963956106 |
12 | 493665953 |
13 | 269442480 |
14 | 15693339d |
15 | c0380c60 |
hex | 7a5e450f |
2052998415 has 48 divisors (see below), whose sum is σ = 3836851200. Its totient is φ = 1009497600.
The previous prime is 2052998329. The next prime is 2052998429. The reversal of 2052998415 is 5148992502.
It is a happy number.
2052998415 is a `hidden beast` number, since 20 + 529 + 98 + 4 + 15 = 666.
It is not a de Polignac number, because 2052998415 - 27 = 2052998287 is a prime.
It is a super-3 number, since 3×20529984153 (a number of 29 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
Together with 1783852785 it forms an amicable pair .
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 671811 + ... + 674859.
It is an arithmetic number, because the mean of its divisors is an integer number (79934400).
Almost surely, 22052998415 is an apocalyptic number.
2052998415 is a deficient number, since it is larger than the sum of its proper divisors (1783852785).
2052998415 is a wasteful number, since it uses less digits than its factorization.
2052998415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4224 (or 4221 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 45.
The square root of 2052998415 is about 45310.0255462298. The cubic root of 2052998415 is about 1270.9531388285.
The spelling of 2052998415 in words is "two billion, fifty-two million, nine hundred ninety-eight thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •