Base | Representation |
---|---|
bin | 1100000100110001011100… |
… | …0010001100111011011011 |
3 | 1202000012000100111110200111 |
4 | 3001030113002030323123 |
5 | 3220004003333141042 |
6 | 44122545312345151 |
7 | 2540111613104626 |
oct | 301142702147333 |
9 | 52005010443614 |
10 | 13276130365147 |
11 | 4259414535041 |
12 | 15a50052451b7 |
13 | 753c1a503720 |
14 | 33c7d4d84dbd |
15 | 180521506517 |
hex | c131708cedb |
13276130365147 has 32 divisors (see below), whose sum is σ = 14458199535360. Its totient is φ = 12117492777600.
The previous prime is 13276130365139. The next prime is 13276130365181. The reversal of 13276130365147 is 74156303167231.
It is a cyclic number.
It is not a de Polignac number, because 13276130365147 - 23 = 13276130365139 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13276130365147.
It is not an unprimeable number, because it can be changed into a prime (13276130369147) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1840580113 + ... + 1840587325.
It is an arithmetic number, because the mean of its divisors is an integer number (451818735480).
Almost surely, 213276130365147 is an apocalyptic number.
13276130365147 is a deficient number, since it is larger than the sum of its proper divisors (1182069170213).
13276130365147 is a wasteful number, since it uses less digits than its factorization.
13276130365147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9643.
The product of its (nonzero) digits is 1905120, while the sum is 49.
The spelling of 13276130365147 in words is "thirteen trillion, two hundred seventy-six billion, one hundred thirty million, three hundred sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •