Base | Representation |
---|---|
bin | 110001110010… |
… | …100001111001 |
3 | 220120010000100 |
4 | 301302201321 |
5 | 11320131100 |
6 | 1143430013 |
7 | 215640360 |
oct | 61624171 |
9 | 26503010 |
10 | 13052025 |
11 | 74051a8 |
12 | 4455309 |
13 | 291cabc |
14 | 1a3a7d7 |
15 | 122c400 |
hex | c72879 |
13052025 has 36 divisors (see below), whose sum is σ = 26720512. Its totient is φ = 5965920.
The previous prime is 13052021. The next prime is 13052033. The reversal of 13052025 is 52025031.
It is a happy number.
13052025 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13052025 - 22 = 13052021 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13051989 and 13052007.
It is not an unprimeable number, because it can be changed into a prime (13052021) 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, 2569 + ... + 5718.
Almost surely, 213052025 is an apocalyptic number.
13052025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13052025 is an abundant number, since it is smaller than the sum of its proper divisors (13668487).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13052025 is a wasteful number, since it uses less digits than its factorization.
13052025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8310 (or 8302 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 13052025 is about 3612.7586412602. The cubic root of 13052025 is about 235.4467133011.
Adding to 13052025 its reverse (52025031), we get a palindrome (65077056).
The spelling of 13052025 in words is "thirteen million, fifty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •