Base | Representation |
---|---|
bin | 1011110101011001111110… |
… | …0000110100011011110111 |
3 | 1201001221120212020002121210 |
4 | 2331112133200310123313 |
5 | 3201142321310322221 |
6 | 43401405130012503 |
7 | 2512044523046502 |
oct | 275263740643367 |
9 | 51057525202553 |
10 | 13012132120311 |
11 | 41674613a1305 |
12 | 1561a08877133 |
13 | 7350672cb82c |
14 | 32db0d3d6139 |
15 | 17871e804276 |
hex | bd59f8346f7 |
13012132120311 has 8 divisors (see below), whose sum is σ = 17422101584640. Its totient is φ = 8638458701432.
The previous prime is 13012132120289. The next prime is 13012132120333. The reversal of 13012132120311 is 11302123121031.
It is an interprime number because it is at equal distance from previous prime (13012132120289) and next prime (13012132120333).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13012132120311 - 235 = 12977772381943 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012132127311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9074010525 + ... + 9074011958.
It is an arithmetic number, because the mean of its divisors is an integer number (2177762698080).
Almost surely, 213012132120311 is an apocalyptic number.
13012132120311 is a deficient number, since it is larger than the sum of its proper divisors (4409969464329).
13012132120311 is a wasteful number, since it uses less digits than its factorization.
13012132120311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18148022725.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13012132120311 its reverse (11302123121031), we get a palindrome (24314255241342).
The spelling of 13012132120311 in words is "thirteen trillion, twelve billion, one hundred thirty-two million, one hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •