Base | Representation |
---|---|
bin | 10111111011110010110100… |
… | …01100011011010101111001 |
3 | 20220100120111112101101212102 |
4 | 23331321122030123111321 |
5 | 23344310410331433340 |
6 | 303534454305353145 |
7 | 14041353035215466 |
oct | 1375713214332571 |
9 | 226316445341772 |
10 | 52632042452345 |
11 | 1585213a939144 |
12 | 5aa05386387b5 |
13 | 234a246198b05 |
14 | cdd593b3266d |
15 | 614130a80215 |
hex | 2fde5a31b579 |
52632042452345 has 8 divisors (see below), whose sum is σ = 63158557288776. Its totient is φ = 42105563064576.
The previous prime is 52632042452323. The next prime is 52632042452387. The reversal of 52632042452345 is 54325424023625.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 103003125481 + 52529039326864 = 320941^2 + 7247692^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52632042452345 - 210 = 52632042451321 is a prime.
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 52632042452345.
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, 5478272 + ... + 11630801.
It is an arithmetic number, because the mean of its divisors is an integer number (7894819661097).
Almost surely, 252632042452345 is an apocalyptic number.
It is an amenable number.
52632042452345 is a deficient number, since it is larger than the sum of its proper divisors (10526514836431).
52632042452345 is a wasteful number, since it uses less digits than its factorization.
52632042452345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17724331.
The product of its (nonzero) digits is 6912000, while the sum is 47.
The spelling of 52632042452345 in words is "fifty-two trillion, six hundred thirty-two billion, forty-two million, four hundred fifty-two thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •