Base | Representation |
---|---|
bin | 10111111011100110011100… |
… | …10011001101011000010001 |
3 | 20220022221100122021212010210 |
4 | 23331303032103031120101 |
5 | 23344203310003441000 |
6 | 303531435240314333 |
7 | 14041026324154020 |
oct | 1375631623153021 |
9 | 226287318255123 |
10 | 52625400452625 |
11 | 1584a341683480 |
12 | 5a9b1a41729a9 |
13 | 23497280ba670 |
14 | cdd1239668b7 |
15 | 613d928d0350 |
hex | 2fdcce4cd611 |
52625400452625 has 512 divisors, whose sum is σ = 123692031590400. Its totient is φ = 19161225216000.
The previous prime is 52625400452591. The next prime is 52625400452641.
52625400452625 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 52625400452625 - 26 = 52625400452561 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 642225657 + ... + 642307593.
It is an arithmetic number, because the mean of its divisors is an integer number (241585999200).
Almost surely, 252625400452625 is an apocalyptic number.
52625400452625 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52625400452625 is an abundant number, since it is smaller than the sum of its proper divisors (71066631137775).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52625400452625 is a wasteful number, since it uses less digits than its factorization.
52625400452625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82074 (or 82064 counting only the distinct ones).
The product of its (nonzero) digits is 5760000, while the sum is 48.
The spelling of 52625400452625 in words is "fifty-two trillion, six hundred twenty-five billion, four hundred million, four hundred fifty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •