Base | Representation |
---|---|
bin | 110100110100110011… |
… | …1111010010110111111 |
3 | 101211210220200001210211 |
4 | 1221221213322112333 |
5 | 3324311423020111 |
6 | 124040355013251 |
7 | 11124115313626 |
oct | 1515147722677 |
9 | 354726601724 |
10 | 113441220031 |
11 | 4412367a707 |
12 | 19b9b29a227 |
13 | a90b425989 |
14 | 56c22406bd |
15 | 2e3e293521 |
hex | 1a699fa5bf |
113441220031 has 8 divisors (see below), whose sum is σ = 121060016640. Its totient is φ = 105927510528.
The previous prime is 113441220029. The next prime is 113441220043. The reversal of 113441220031 is 130022144311.
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 113441220031 - 21 = 113441220029 is a prime.
It is a super-2 number, since 2×1134412200312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113441219984 and 113441220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113441220131) 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, 26269546 + ... + 26273863.
It is an arithmetic number, because the mean of its divisors is an integer number (15132502080).
Almost surely, 2113441220031 is an apocalyptic number.
113441220031 is a deficient number, since it is larger than the sum of its proper divisors (7618796609).
113441220031 is a wasteful number, since it uses less digits than its factorization.
113441220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52543553.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 113441220031 its reverse (130022144311), we get a palindrome (243463364342).
The spelling of 113441220031 in words is "one hundred thirteen billion, four hundred forty-one million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •