Base | Representation |
---|---|
bin | 1100000001000000… |
… | …1101010111011101 |
3 | 22022210022002020110 |
4 | 3000100031113131 |
5 | 23101210141100 |
6 | 1252021040233 |
7 | 142634036550 |
oct | 30020152735 |
9 | 8283262213 |
10 | 3225474525 |
11 | 1405772829 |
12 | 760256079 |
13 | 3c531aa10 |
14 | 22853a697 |
15 | 13d281250 |
hex | c040d5dd |
3225474525 has 48 divisors (see below), whose sum is σ = 6563441024. Its totient is φ = 1361076480.
The previous prime is 3225474521. The next prime is 3225474541. The reversal of 3225474525 is 5254745223.
It is not a de Polignac number, because 3225474525 - 22 = 3225474521 is a prime.
It is a super-2 number, since 2×32254745252 = 20807371822847951250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3225474521) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 229474 + ... + 243123.
Almost surely, 23225474525 is an apocalyptic number.
3225474525 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3225474525 is an abundant number, since it is smaller than the sum of its proper divisors (3337966499).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3225474525 is a wasteful number, since it uses less digits than its factorization.
3225474525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472630 (or 472625 counting only the distinct ones).
The product of its digits is 336000, while the sum is 39.
The square root of 3225474525 is about 56793.2612639915. The cubic root of 3225474525 is about 1477.5126415758.
The spelling of 3225474525 in words is "three billion, two hundred twenty-five million, four hundred seventy-four thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •