Base | Representation |
---|---|
bin | 11001101111111000001100… |
… | …111101000001101001010011 |
3 | 112211221202122122110211001201 |
4 | 121233320030331001221103 |
5 | 104320321213203103301 |
6 | 1040502202504412031 |
7 | 32565262413044413 |
oct | 3157701475015123 |
9 | 484852578424051 |
10 | 113241325050451 |
11 | 3309a415883124 |
12 | 1084ab16777017 |
13 | 4b257c386bbb0 |
14 | 1dd6ca3488643 |
15 | d15a003a0201 |
hex | 66fe0cf41a53 |
113241325050451 has 8 divisors (see below), whose sum is σ = 122159951235504. Its totient is φ = 104352378155040.
The previous prime is 113241325050433. The next prime is 113241325050517. The reversal of 113241325050451 is 154050523142311.
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 113241325050451 - 215 = 113241325017683 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113241325050451.
It is not an unprimeable number, because it can be changed into a prime (113241325950451) 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, 7419814480 + ... + 7419829741.
It is an arithmetic number, because the mean of its divisors is an integer number (15269993904438).
Almost surely, 2113241325050451 is an apocalyptic number.
113241325050451 is a deficient number, since it is larger than the sum of its proper divisors (8918626185053).
113241325050451 is a wasteful number, since it uses less digits than its factorization.
113241325050451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14839644821.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 113241325050451 its reverse (154050523142311), we get a palindrome (267291848192762).
The spelling of 113241325050451 in words is "one hundred thirteen trillion, two hundred forty-one billion, three hundred twenty-five million, fifty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •