Base | Representation |
---|---|
bin | 1011111011001111111101… |
… | …1001011111110110111011 |
3 | 1201102112201102020220221012 |
4 | 2332303333121133312323 |
5 | 3204313422403432223 |
6 | 43515451051104135 |
7 | 2522230411010354 |
oct | 276637731376673 |
9 | 51375642226835 |
10 | 13112525061563 |
11 | 41a5a99610a44 |
12 | 157936614204b |
13 | 74167634a995 |
14 | 334914700d2b |
15 | 17b1482aac78 |
hex | becff65fdbb |
13112525061563 has 8 divisors (see below), whose sum is σ = 13803840231120. Its totient is φ = 12421328119200.
The previous prime is 13112525061527. The next prime is 13112525061611. The reversal of 13112525061563 is 36516052521131.
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 13112525061563 - 230 = 13111451319739 is a prime.
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 13112525061563.
It is not an unprimeable number, because it can be changed into a prime (13112525064563) 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, 29329088 + ... + 29772813.
It is an arithmetic number, because the mean of its divisors is an integer number (1725480028890).
Almost surely, 213112525061563 is an apocalyptic number.
13112525061563 is a deficient number, since it is larger than the sum of its proper divisors (691315169557).
13112525061563 is a wasteful number, since it uses less digits than its factorization.
13112525061563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59113597.
The product of its (nonzero) digits is 162000, while the sum is 41.
Adding to 13112525061563 its reverse (36516052521131), we get a palindrome (49628577582694).
The spelling of 13112525061563 in words is "thirteen trillion, one hundred twelve billion, five hundred twenty-five million, sixty-one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •