Base | Representation |
---|---|
bin | 1011111100100000110000… |
… | …0100100101111000100001 |
3 | 1201111121200212001001001022 |
4 | 2333020030010211320201 |
5 | 3210142331401142010 |
6 | 43533435100415225 |
7 | 2523626013250505 |
oct | 277101404457041 |
9 | 51447625031038 |
10 | 13134212521505 |
11 | 4204208618659 |
12 | 15815b9247515 |
13 | 74372150110a |
14 | 3359b0b66305 |
15 | 17b9b724ed55 |
hex | bf20c125e21 |
13134212521505 has 8 divisors (see below), whose sum is σ = 15762570720000. Its totient is φ = 10506359554416.
The previous prime is 13134212521501. The next prime is 13134212521519. The reversal of 13134212521505 is 50512521243131.
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 13134212521505 - 22 = 13134212521501 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13134212521501) 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 7 ways as a sum of consecutive naturals, for example, 126250655 + ... + 126354644.
It is an arithmetic number, because the mean of its divisors is an integer number (1970321340000).
Almost surely, 213134212521505 is an apocalyptic number.
It is an amenable number.
13134212521505 is a deficient number, since it is larger than the sum of its proper divisors (2628358198495).
13134212521505 is a wasteful number, since it uses less digits than its factorization.
13134212521505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252615703.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 13134212521505 its reverse (50512521243131), we get a palindrome (63646733764636).
The spelling of 13134212521505 in words is "thirteen trillion, one hundred thirty-four billion, two hundred twelve million, five hundred twenty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •