Base | Representation |
---|---|
bin | 11001101100110011110111… |
… | …111111111101100110000011 |
3 | 112211012121112021202211201121 |
4 | 121230303313333331212003 |
5 | 104303343001121220001 |
6 | 1040221300515013111 |
7 | 32544120441406654 |
oct | 3154636777754603 |
9 | 484177467684647 |
10 | 113030520101251 |
11 | 33018a79996745 |
12 | 108160a459a197 |
13 | 4b0b969b68a6c |
14 | 1dca9c638b52b |
15 | d102b35696a1 |
hex | 66ccf7ffd983 |
113030520101251 has 8 divisors (see below), whose sum is σ = 119826944367984. Its totient is φ = 106250492517120.
The previous prime is 113030520101221. The next prime is 113030520101297. The reversal of 113030520101251 is 152101025030311.
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 113030520101251 - 29 = 113030520100739 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113030520101221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4099156450 + ... + 4099184023.
It is an arithmetic number, because the mean of its divisors is an integer number (14978368045998).
Almost surely, 2113030520101251 is an apocalyptic number.
113030520101251 is a deficient number, since it is larger than the sum of its proper divisors (6796424266733).
113030520101251 is an equidigital number, since it uses as much as digits as its factorization.
113030520101251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8198341301.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 113030520101251 its reverse (152101025030311), we get a palindrome (265131545131562).
The spelling of 113030520101251 in words is "one hundred thirteen trillion, thirty billion, five hundred twenty million, one hundred one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •