Base | Representation |
---|---|
bin | 1010001111111011110… |
… | …01101100011110110001 |
3 | 1020122222002022202200201 |
4 | 11013331321230132301 |
5 | 21232201420023100 |
6 | 425435413515201 |
7 | 34304441361301 |
oct | 5077571543661 |
9 | 1218862282621 |
10 | 352152111025 |
11 | 12638a760200 |
12 | 582bb042b01 |
13 | 272917036c0 |
14 | 13089605601 |
15 | 9260e6136a |
hex | 51fde6c7b1 |
352152111025 has 36 divisors (see below), whose sum is σ = 516895776796. Its totient is φ = 236409782400.
The previous prime is 352152111023. The next prime is 352152111161. The reversal of 352152111025 is 520111251253.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 204175521 + 351947935504 = 14289^2 + 593252^2 .
It is not a de Polignac number, because 352152111025 - 21 = 352152111023 is a prime.
It is a super-2 number, since 2×3521521110252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 352152110984 and 352152111002.
It is not an unprimeable number, because it can be changed into a prime (352152111023) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4438134 + ... + 4516783.
Almost surely, 2352152111025 is an apocalyptic number.
It is an amenable number.
352152111025 is a deficient number, since it is larger than the sum of its proper divisors (164743665771).
352152111025 is a wasteful number, since it uses less digits than its factorization.
352152111025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8954962 (or 8954946 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 352152111025 its reverse (520111251253), we get a palindrome (872263362278).
The spelling of 352152111025 in words is "three hundred fifty-two billion, one hundred fifty-two million, one hundred eleven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •