Base | Representation |
---|---|
bin | 110100101011000001… |
… | …1111011111100001111 |
3 | 101210222001002220001110 |
4 | 1221112003323330033 |
5 | 3323123413202343 |
6 | 123544032343103 |
7 | 11113021552665 |
oct | 1512603737417 |
9 | 353861086043 |
10 | 113113022223 |
11 | 43a75396853 |
12 | 19b093a4a93 |
13 | a8884342a6 |
14 | 569080ac35 |
15 | 2e20564833 |
hex | 1a560fbf0f |
113113022223 has 8 divisors (see below), whose sum is σ = 150818919088. Its totient is φ = 75407903424.
The previous prime is 113113022219. The next prime is 113113022227. The reversal of 113113022223 is 322220311311.
It is an interprime number because it is at equal distance from previous prime (113113022219) and next prime (113113022227).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113113022223 - 22 = 113113022219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113113022223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113113022227) 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, 446115 + ... + 652107.
It is an arithmetic number, because the mean of its divisors is an integer number (18852364886).
Almost surely, 2113113022223 is an apocalyptic number.
113113022223 is a deficient number, since it is larger than the sum of its proper divisors (37705896865).
113113022223 is a wasteful number, since it uses less digits than its factorization.
113113022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 389033.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113113022223 its reverse (322220311311), we get a palindrome (435333333534).
The spelling of 113113022223 in words is "one hundred thirteen billion, one hundred thirteen million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •