Base | Representation |
---|---|
bin | 11001000011110011… |
… | …01101110111100100 |
3 | 1021201121110202120011 |
4 | 30201321231313210 |
5 | 210023120230400 |
6 | 10102555020004 |
7 | 654252252100 |
oct | 144171556744 |
9 | 37647422504 |
10 | 13453680100 |
11 | 5784284a93 |
12 | 273573a604 |
13 | 1365389773 |
14 | 918b04900 |
15 | 53b1ba8ba |
hex | 321e6dde4 |
13453680100 has 81 divisors (see below), whose sum is σ = 33981440283. Its totient is φ = 4609906560.
The previous prime is 13453680067. The next prime is 13453680127. The reversal of 13453680100 is 108635431.
The square root of 13453680100 is 115990.
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 1394126244 + 12059553856 = 37338^2 + 109816^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 8118472 + ... + 8120128.
Almost surely, 213453680100 is an apocalyptic number.
13453680100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13453680100 is the 115990-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13453680100
13453680100 is an abundant number, since it is smaller than the sum of its proper divisors (20527760183).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13453680100 is an equidigital number, since it uses as much as digits as its factorization.
13453680100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3342 (or 1671 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 13453680100 in words is "thirteen billion, four hundred fifty-three million, six hundred eighty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •