Base | Representation |
---|---|
bin | 110100110001100111… |
… | …1011001100101001110 |
3 | 101211112110011101022020 |
4 | 1221203033121211032 |
5 | 3324102014143042 |
6 | 124022011431010 |
7 | 11121345135030 |
oct | 1514317314516 |
9 | 354473141266 |
10 | 113334131022 |
11 | 440791870a2 |
12 | 19b6b455466 |
13 | a8c219c5b8 |
14 | 56b1d25c50 |
15 | 2e34b8d3ec |
hex | 1a633d994e |
113334131022 has 128 divisors (see below), whose sum is σ = 272792475648. Its totient is φ = 30690316800.
The previous prime is 113334131017. The next prime is 113334131023. The reversal of 113334131022 is 220131433311.
It is a junction number, because it is equal to n+sod(n) for n = 113334130983 and 113334131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113334131023) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 69915372 + ... + 69916992.
It is an arithmetic number, because the mean of its divisors is an integer number (2131191216).
Almost surely, 2113334131022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113334131022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136396237824).
113334131022 is an abundant number, since it is smaller than the sum of its proper divisors (159458344626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113334131022 is a wasteful number, since it uses less digits than its factorization.
113334131022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2274.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 113334131022 its reverse (220131433311), we get a palindrome (333465564333).
The spelling of 113334131022 in words is "one hundred thirteen billion, three hundred thirty-four million, one hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •