Base | Representation |
---|---|
bin | 110100101110010001… |
… | …1110001011111000101 |
3 | 101211020122020010101201 |
4 | 1221130203301133011 |
5 | 3323334320000201 |
6 | 124002525022501 |
7 | 11115514246501 |
oct | 1513443613705 |
9 | 354218203351 |
10 | 113222031301 |
11 | 440209809a5 |
12 | 19b399b4a31 |
13 | a8a4bb05c2 |
14 | 56a10a5301 |
15 | 2e29de8801 |
hex | 1a5c8f17c5 |
113222031301 has 8 divisors (see below), whose sum is σ = 119233656800. Its totient is φ = 107215662960.
The previous prime is 113222031233. The next prime is 113222031341. The reversal of 113222031301 is 103130222311.
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 113222031301 - 217 = 113221900229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113222031341) 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, 1270035 + ... + 1356256.
It is an arithmetic number, because the mean of its divisors is an integer number (14904207100).
Almost surely, 2113222031301 is an apocalyptic number.
It is an amenable number.
113222031301 is a deficient number, since it is larger than the sum of its proper divisors (6011625499).
113222031301 is a wasteful number, since it uses less digits than its factorization.
113222031301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2628579.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113222031301 its reverse (103130222311), we get a palindrome (216352253612).
It can be divided in two parts, 11322 and 2031301, that multiplied together give a palindrome (22998389922).
The spelling of 113222031301 in words is "one hundred thirteen billion, two hundred twenty-two million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •