Base | Representation |
---|---|
bin | 110100101000000010… |
… | …0001011100110000001 |
3 | 101210201000210220220211 |
4 | 1221100010023212001 |
5 | 3322422140014131 |
6 | 123530040234121 |
7 | 11110360513630 |
oct | 1512004134601 |
9 | 353630726824 |
10 | 113012423041 |
11 | 43a23626131 |
12 | 19a9b76b941 |
13 | a870640b4b |
14 | 5681301517 |
15 | 2e167e25b1 |
hex | 1a5010b981 |
113012423041 has 8 divisors (see below), whose sum is σ = 129482390720. Its totient is φ = 96623789328.
The previous prime is 113012423011. The next prime is 113012423059. The reversal of 113012423041 is 140324210311.
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 113012423041 - 25 = 113012423009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113012423011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20330511 + ... + 20336068.
It is an arithmetic number, because the mean of its divisors is an integer number (16185298840).
Almost surely, 2113012423041 is an apocalyptic number.
It is an amenable number.
113012423041 is a deficient number, since it is larger than the sum of its proper divisors (16469967679).
113012423041 is an equidigital number, since it uses as much as digits as its factorization.
113012423041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40666983.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 113012423041 its reverse (140324210311), we get a palindrome (253336633352).
It can be divided in two parts, 11301 and 2423041, that added together give a palindrome (2434342).
The spelling of 113012423041 in words is "one hundred thirteen billion, twelve million, four hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •