Base | Representation |
---|---|
bin | 110100101110001110… |
… | …1001011010011001111 |
3 | 101211020111222021021200 |
4 | 1221130131023103033 |
5 | 3323333344131111 |
6 | 124002424000543 |
7 | 11115463455054 |
oct | 1513435132317 |
9 | 354214867250 |
10 | 113220302031 |
11 | 4401a9aa751 |
12 | 19b39300153 |
13 | a8a4726475 |
14 | 56a0b7502b |
15 | 2e29ba6256 |
hex | 1a5c74b4cf |
113220302031 has 12 divisors (see below), whose sum is σ = 167960448552. Its totient is φ = 73440195696.
The previous prime is 113220301991. The next prime is 113220302053. The reversal of 113220302031 is 130203022311.
113220302031 is a `hidden beast` number, since 11 + 322 + 0 + 302 + 0 + 31 = 666.
It is not a de Polignac number, because 113220302031 - 218 = 113220039887 is a prime.
It is a super-2 number, since 2×1132203020312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113220301995 and 113220302013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113220302081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 170000121 + ... + 170000786.
It is an arithmetic number, because the mean of its divisors is an integer number (13996704046).
Almost surely, 2113220302031 is an apocalyptic number.
113220302031 is a deficient number, since it is larger than the sum of its proper divisors (54740146521).
113220302031 is a wasteful number, since it uses less digits than its factorization.
113220302031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340000950 (or 340000947 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 113220302031 its reverse (130203022311), we get a palindrome (243423324342).
The spelling of 113220302031 in words is "one hundred thirteen billion, two hundred twenty million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •