Base | Representation |
---|---|
bin | 1100010000101011011000… |
… | …0001100110000111000100 |
3 | 1202201201221110102202210211 |
4 | 3010022312001212013010 |
5 | 3231331343234341104 |
6 | 44400532535125204 |
7 | 2560642231651162 |
oct | 304126601460704 |
9 | 52651843382724 |
10 | 13480661246404 |
11 | 4328130919400 |
12 | 1618786213804 |
13 | 76a2b441c511 |
14 | 348678ad0232 |
15 | 1859e2618e04 |
hex | c42b60661c4 |
13480661246404 has 81 divisors (see below), whose sum is σ = 26121565672461. Its totient is φ = 6082816465440.
The previous prime is 13480661246363. The next prime is 13480661246449. The reversal of 13480661246404 is 40464216608431.
The square root of 13480661246404 is 3671602.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3951388596100 + 9529272650304 = 1987810^2 + 3086952^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 12681712777 + ... + 12681713839.
Almost surely, 213480661246404 is an apocalyptic number.
13480661246404 is the 3671602-nd square number.
It is an amenable number.
13480661246404 is a deficient number, since it is larger than the sum of its proper divisors (12640904426057).
13480661246404 is an equidigital number, since it uses as much as digits as its factorization.
13480661246404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2466 (or 1233 counting only the distinct ones).
The product of its (nonzero) digits is 2654208, while the sum is 49.
Multiplying 13480661246404 by its sum of digits (49), we get a square (660552401073796 = 257012142).
The spelling of 13480661246404 in words is "thirteen trillion, four hundred eighty billion, six hundred sixty-one million, two hundred forty-six thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •