Base | Representation |
---|---|
bin | 110000100011000110… |
… | …110101100101100101 |
3 | 11222112221011101021100 |
4 | 300203012311211211 |
5 | 1323224410234334 |
6 | 35540400510313 |
7 | 3523536544566 |
oct | 604306654545 |
9 | 158487141240 |
10 | 52128602469 |
11 | 20120267649 |
12 | a12991b399 |
13 | 4bb9a63708 |
14 | 274730416d |
15 | 15516abc99 |
hex | c231b5965 |
52128602469 has 6 divisors (see below), whose sum is σ = 75296870246. Its totient is φ = 34752401640.
The previous prime is 52128602459. The next prime is 52128602501. The reversal of 52128602469 is 96420682125.
52128602469 is a `hidden beast` number, since 5 + 2 + 128 + 60 + 2 + 469 = 666.
It can be written as a sum of positive squares in only one way, i.e., 39788280900 + 12340321569 = 199470^2 + 111087^2 .
It is not a de Polignac number, because 52128602469 - 29 = 52128601957 is a prime.
It is a super-2 number, since 2×521286024692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52128602459) 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, 2896033462 + ... + 2896033479.
Almost surely, 252128602469 is an apocalyptic number.
It is an amenable number.
52128602469 is a deficient number, since it is larger than the sum of its proper divisors (23168267777).
52128602469 is a wasteful number, since it uses less digits than its factorization.
52128602469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5792066947 (or 5792066944 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The spelling of 52128602469 in words is "fifty-two billion, one hundred twenty-eight million, six hundred two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •