Base | Representation |
---|---|
bin | 110100110001101000… |
… | …0100110000100101011 |
3 | 101211112110202022002021 |
4 | 1221203100212010223 |
5 | 3324102104204311 |
6 | 124022022245311 |
7 | 11121350611333 |
oct | 1514320460453 |
9 | 354473668067 |
10 | 113334444331 |
11 | 44079380529 |
12 | 19b6b586837 |
13 | a8c227c0a4 |
14 | 56b1da80c3 |
15 | 2e34c01171 |
hex | 1a6342612b |
113334444331 has 8 divisors (see below), whose sum is σ = 113984334464. Its totient is φ = 112684815360.
The previous prime is 113334444319. The next prime is 113334444343. The reversal of 113334444331 is 133444433311.
It is an interprime number because it is at equal distance from previous prime (113334444319) and next prime (113334444343).
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 113334444331 - 215 = 113334411563 is a prime.
It is a super-2 number, since 2×1133344443312 (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 (113334444361) 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, 841030 + ... + 966436.
It is an arithmetic number, because the mean of its divisors is an integer number (14248041808).
Almost surely, 2113334444331 is an apocalyptic number.
113334444331 is a deficient number, since it is larger than the sum of its proper divisors (649890133).
113334444331 is a wasteful number, since it uses less digits than its factorization.
113334444331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130581.
The product of its digits is 62208, while the sum is 34.
Adding to 113334444331 its reverse (133444433311), we get a palindrome (246778877642).
The spelling of 113334444331 in words is "one hundred thirteen billion, three hundred thirty-four million, four hundred forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •