Base | Representation |
---|---|
bin | 11000010010000010… |
… | …00000000000000000 |
3 | 1020122111211111020211 |
4 | 30021001000000000 |
5 | 203144224041401 |
6 | 5553322043504 |
7 | 641022344251 |
oct | 141101000000 |
9 | 36574744224 |
10 | 13036158976 |
11 | 558a632205 |
12 | 2639949594 |
13 | 12c9a22149 |
14 | 8b949cb28 |
15 | 5146e5951 |
hex | 309040000 |
13036158976 has 57 divisors (see below), whose sum is σ = 26189708511. Its totient is φ = 6488850432.
The previous prime is 13036158953. The next prime is 13036158991. The reversal of 13036158976 is 67985163031.
The square root of 13036158976 is 114176.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 58458001 + ... + 58458223.
Almost surely, 213036158976 is an apocalyptic number.
13036158976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
13036158976 is the 114176-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13036158976
13036158976 is an abundant number, since it is smaller than the sum of its proper divisors (13153549535).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13036158976 is an frugal number, since it uses more digits than its factorization.
13036158976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482 (or 225 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 49.
Multiplying 13036158976 by its sum of digits (49), we get a square (638771789824 = 7992322).
The spelling of 13036158976 in words is "thirteen billion, thirty-six million, one hundred fifty-eight thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •