Base | Representation |
---|---|
bin | 1011111110010001010100… |
… | …1100001010010000100100 |
3 | 1201121111200210001210021221 |
4 | 2333210111030022100210 |
5 | 3211141223122142044 |
6 | 43555353351550124 |
7 | 2526045566012200 |
oct | 277442514122044 |
9 | 51544623053257 |
10 | 13164430271524 |
11 | 4216004768484 |
12 | 158743108b344 |
13 | 746528a2677c |
14 | 33723a093b00 |
15 | 17c68503c484 |
hex | bf91530a424 |
13164430271524 has 27 divisors (see below), whose sum is σ = 26799122173467. Its totient is φ = 5641876918104.
The previous prime is 13164430271521. The next prime is 13164430271561. The reversal of 13164430271524 is 42517203446131.
The square root of 13164430271524 is 3628282.
It is a perfect power (a square), and thus also a powerful number.
It is not an unprimeable number, because it can be changed into a prime (13164430271521) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 50666367 + ... + 50925529.
Almost surely, 213164430271524 is an apocalyptic number.
13164430271524 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13164430271524 is the 3628282-nd square number.
It is an amenable number.
13164430271524 is an abundant number, since it is smaller than the sum of its proper divisors (13634691901943).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13164430271524 is an frugal number, since it uses more digits than its factorization.
13164430271524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518344 (or 259172 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 13164430271524 in words is "thirteen trillion, one hundred sixty-four billion, four hundred thirty million, two hundred seventy-one thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •