Base | Representation |
---|---|
bin | 11001000111010000… |
… | …11001001001101001 |
3 | 1021210122001210002100 |
4 | 30203220121021221 |
5 | 210103032140400 |
6 | 10105512524013 |
7 | 655054000341 |
oct | 144350311151 |
9 | 37718053070 |
10 | 13482693225 |
11 | 57996a0a81 |
12 | 27433b0609 |
13 | 136b3a74b1 |
14 | 91c8d7d21 |
15 | 53d9ec100 |
hex | 323a19269 |
13482693225 has 27 divisors (see below), whose sum is σ = 24152121669. Its totient is φ = 7189840800.
The previous prime is 13482693193. The next prime is 13482693229. The reversal of 13482693225 is 52239628431.
The square root of 13482693225 is 116115.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 2623385961 + 10859307264 = 51219^2 + 104208^2 .
It is not a de Polignac number, because 13482693225 - 25 = 13482693193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (13482693229) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1737855 + ... + 1745595.
Almost surely, 213482693225 is an apocalyptic number.
13482693225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13482693225 is the 116115-th square number.
13482693225 is the 58058-th centered octagonal number.
It is an amenable number.
13482693225 is a deficient number, since it is larger than the sum of its proper divisors (10669428444).
13482693225 is an frugal number, since it uses more digits than its factorization.
13482693225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15498 (or 7749 counting only the distinct ones).
The product of its digits is 622080, while the sum is 45.
The spelling of 13482693225 in words is "thirteen billion, four hundred eighty-two million, six hundred ninety-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •