Base | Representation |
---|---|
bin | 1100000011010000011110… |
… | …0000101010110001111001 |
3 | 1201220200211020222121221022 |
4 | 3000310013200222301321 |
5 | 3214042201112100010 |
6 | 44103002325552225 |
7 | 2535200555442344 |
oct | 300640740526171 |
9 | 51820736877838 |
10 | 13250100112505 |
11 | 42493770a1a53 |
12 | 159bb5b875675 |
13 | 75162c6ca079 |
14 | 33b445c5745b |
15 | 17e9eb178d55 |
hex | c0d0782ac79 |
13250100112505 has 8 divisors (see below), whose sum is σ = 15900304846272. Its totient is φ = 10599956949168.
The previous prime is 13250100112493. The next prime is 13250100112507. The reversal of 13250100112505 is 50521100105231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13250100112505 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13250100112507) 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, 14917829 + ... + 15781058.
It is an arithmetic number, because the mean of its divisors is an integer number (1987538105784).
Almost surely, 213250100112505 is an apocalyptic number.
It is an amenable number.
13250100112505 is a deficient number, since it is larger than the sum of its proper divisors (2650204733767).
13250100112505 is an equidigital number, since it uses as much as digits as its factorization.
13250100112505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30785215.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 13250100112505 its reverse (50521100105231), we get a palindrome (63771200217736).
The spelling of 13250100112505 in words is "thirteen trillion, two hundred fifty billion, one hundred million, one hundred twelve thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •