Base | Representation |
---|---|
bin | 1011111111100110110010… |
… | …0100000101111001000100 |
3 | 1201200200220120002111202121 |
4 | 2333321230210011321010 |
5 | 3212030213433434424 |
6 | 44014110011215324 |
7 | 2530520226665512 |
oct | 277715444057104 |
9 | 51620816074677 |
10 | 13187370999364 |
11 | 4224807153891 |
12 | 158b973a47544 |
13 | 748743732043 |
14 | 3383b4b534b2 |
15 | 17d07903eee4 |
hex | bfe6c905e44 |
13187370999364 has 27 divisors (see below), whose sum is σ = 23160669630007. Its totient is φ = 6570121072544.
The previous prime is 13187370999353. The next prime is 13187370999389. The reversal of 13187370999364 is 46399907378131.
The square root of 13187370999364 is 3631442.
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 2426871696964 + 10760499302400 = 1557842^2 + 3280320^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13187370999293 and 13187370999302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2128021914 + ... + 2128028110.
Almost surely, 213187370999364 is an apocalyptic number.
13187370999364 is the 3631442-nd square number.
It is an amenable number.
13187370999364 is a deficient number, since it is larger than the sum of its proper divisors (9973298630643).
13187370999364 is an frugal number, since it uses more digits than its factorization.
13187370999364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12984 (or 6492 counting only the distinct ones).
The product of its (nonzero) digits is 185177664, while the sum is 70.
The spelling of 13187370999364 in words is "thirteen trillion, one hundred eighty-seven billion, three hundred seventy million, nine hundred ninety-nine thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •