Base | Representation |
---|---|
bin | 10000001001111111000… |
… | …000001101010000101001 |
3 | 10221010200222222122020212 |
4 | 100021333000031100221 |
5 | 121142223433314423 |
6 | 2210011135430505 |
7 | 143132410016234 |
oct | 20117700152051 |
9 | 3833628878225 |
10 | 1110232323113 |
11 | 398935225881 |
12 | 15b206685435 |
13 | 80904959234 |
14 | 3ba4242441b |
15 | 1dd2de50578 |
hex | 1027f00d429 |
1110232323113 has 8 divisors (see below), whose sum is σ = 1110743137056. Its totient is φ = 1109721600000.
The previous prime is 1110232323103. The next prime is 1110232323131. The reversal of 1110232323113 is 3113232320111.
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 1110232323113 - 26 = 1110232323049 is a prime.
It is a super-2 number, since 2×11102323231132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1110232323103) 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, 37940738 + ... + 37969988.
It is an arithmetic number, because the mean of its divisors is an integer number (138842892132).
Almost surely, 21110232323113 is an apocalyptic number.
It is an amenable number.
1110232323113 is a deficient number, since it is larger than the sum of its proper divisors (510813943).
1110232323113 is a wasteful number, since it uses less digits than its factorization.
1110232323113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45415.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1110232323113 its reverse (3113232320111), we get a palindrome (4223464643224).
The spelling of 1110232323113 in words is "one trillion, one hundred ten billion, two hundred thirty-two million, three hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •