Base | Representation |
---|---|
bin | 11001101110000111001111… |
… | …011000101011111111101011 |
3 | 112211112011120121010202212112 |
4 | 121232013033120223333223 |
5 | 104311324311423430443 |
6 | 1040330343055432535 |
7 | 32553436604635040 |
oct | 3156071730537753 |
9 | 484464517122775 |
10 | 113120033030123 |
11 | 33052a33681009 |
12 | 1082b50622574b |
13 | 4b17233ab1972 |
14 | 1dd10786db1c7 |
15 | d127a1c83b18 |
hex | 66e1cf62bfeb |
113120033030123 has 8 divisors (see below), whose sum is σ = 132286550254848. Its totient is φ = 94705143931944.
The previous prime is 113120033030117. The next prime is 113120033030141. The reversal of 113120033030123 is 321030330021311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113120033030123 - 28 = 113120033029867 is a prime.
It is a super-2 number, since 2×1131200330301232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113120033030023) 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, 187907031311 + ... + 187907031912.
It is an arithmetic number, because the mean of its divisors is an integer number (16535818781856).
Almost surely, 2113120033030123 is an apocalyptic number.
113120033030123 is a deficient number, since it is larger than the sum of its proper divisors (19166517224725).
113120033030123 is an equidigital number, since it uses as much as digits as its factorization.
113120033030123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 375814063273.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 113120033030123 its reverse (321030330021311), we get a palindrome (434150363051434).
The spelling of 113120033030123 in words is "one hundred thirteen trillion, one hundred twenty billion, thirty-three million, thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •