Base | Representation |
---|---|
bin | 101000001111111… |
… | …1100010111110001 |
3 | 10111010022002201100 |
4 | 1100133330113301 |
5 | 10231220113100 |
6 | 342002555013 |
7 | 45316331355 |
oct | 12037742761 |
9 | 3433262640 |
10 | 1350551025 |
11 | 633394a7a |
12 | 318368a69 |
13 | 186a57125 |
14 | cb51d465 |
15 | 7d878400 |
hex | 507fc5f1 |
1350551025 has 72 divisors (see below), whose sum is σ = 2515106880. Its totient is φ = 691931520.
The previous prime is 1350551021. The next prime is 1350551047. The reversal of 1350551025 is 5201550531.
It is not a de Polignac number, because 1350551025 - 22 = 1350551021 is a prime.
It is a super-2 number, since 2×13505510252 = 3647976142257101250, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1350551025.
It is not an unprimeable number, because it can be changed into a prime (1350551021) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1715682 + ... + 1716468.
It is an arithmetic number, because the mean of its divisors is an integer number (34932040).
Almost surely, 21350551025 is an apocalyptic number.
1350551025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1350551025 is a deficient number, since it is larger than the sum of its proper divisors (1164555855).
1350551025 is a wasteful number, since it uses less digits than its factorization.
1350551025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1095 (or 1087 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 1350551025 is about 36749.8438772194. The cubic root of 1350551025 is about 1105.3597990238.
The spelling of 1350551025 in words is "one billion, three hundred fifty million, five hundred fifty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •