Base | Representation |
---|---|
bin | 110100101011101000… |
… | …0001100110000011001 |
3 | 101211000102201120200011 |
4 | 1221113100030300121 |
5 | 3323144022422131 |
6 | 123550025041521 |
7 | 11113353516115 |
oct | 1512720146031 |
9 | 354012646604 |
10 | 113133014041 |
11 | 43a85700a13 |
12 | 19b140262a1 |
13 | a88c613a78 |
14 | 5693332745 |
15 | 2e221b30b1 |
hex | 1a5740cc19 |
113133014041 has 4 divisors (see below), whose sum is σ = 113627044900. Its totient is φ = 112638983184.
The previous prime is 113133014003. The next prime is 113133014089. The reversal of 113133014041 is 140410331311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 102524838025 + 10608176016 = 320195^2 + 102996^2 .
It is a cyclic number.
It is not a de Polignac number, because 113133014041 - 29 = 113133013529 is a prime.
It is a super-2 number, since 2×1131330140412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113133014341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247015086 + ... + 247015543.
It is an arithmetic number, because the mean of its divisors is an integer number (28406761225).
Almost surely, 2113133014041 is an apocalyptic number.
It is an amenable number.
113133014041 is a deficient number, since it is larger than the sum of its proper divisors (494030859).
113133014041 is an equidigital number, since it uses as much as digits as its factorization.
113133014041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494030858.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 113133014041 its reverse (140410331311), we get a palindrome (253543345352).
The spelling of 113133014041 in words is "one hundred thirteen billion, one hundred thirty-three million, fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •