Base | Representation |
---|---|
bin | 11001110000111000011110… |
… | …000010110010011101011001 |
3 | 112212012100202210210222201111 |
4 | 121300320132002302131121 |
5 | 104322434024300004041 |
6 | 1040554014135020321 |
7 | 32603254432055236 |
oct | 3160703602623531 |
9 | 485170683728644 |
10 | 113310331250521 |
11 | 33116706aa6639 |
12 | 1086037480a6a1 |
13 | 4b2c17013a442 |
14 | 1dda36c0c878d |
15 | d176dd606981 |
hex | 670e1e0b2759 |
113310331250521 has 16 divisors (see below), whose sum is σ = 119155983648768. Its totient is φ = 107541501667600.
The previous prime is 113310331250477. The next prime is 113310331250533. The reversal of 113310331250521 is 125052133013311.
It is a cyclic number.
It is not a de Polignac number, because 113310331250521 - 27 = 113310331250393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113310331250581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19119120 + ... + 24334366.
It is an arithmetic number, because the mean of its divisors is an integer number (7447248978048).
Almost surely, 2113310331250521 is an apocalyptic number.
It is an amenable number.
113310331250521 is a deficient number, since it is larger than the sum of its proper divisors (5845652398247).
113310331250521 is a wasteful number, since it uses less digits than its factorization.
113310331250521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5222612.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 113310331250521 its reverse (125052133013311), we get a palindrome (238362464263832).
The spelling of 113310331250521 in words is "one hundred thirteen trillion, three hundred ten billion, three hundred thirty-one million, two hundred fifty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •