Base | Representation |
---|---|
bin | 11001110001000100010011… |
… | …000100011000100001110111 |
3 | 112212020120112221112222121020 |
4 | 121301010103010120201313 |
5 | 104323141032144133421 |
6 | 1041003514320352223 |
7 | 32604214242613023 |
oct | 3161042304304167 |
9 | 485216487488536 |
10 | 113323032021111 |
11 | 33121034283560 |
12 | 1086291a175673 |
13 | 4b30415521003 |
14 | 1ddac14c01383 |
15 | d17bd364cdc6 |
hex | 671113118877 |
113323032021111 has 8 divisors (see below), whose sum is σ = 164833501121664. Its totient is φ = 68680625467320.
The previous prime is 113323032021097. The next prime is 113323032021151. The reversal of 113323032021111 is 111120230323311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113323032021111 - 25 = 113323032021079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323032021151) 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, 1717015636651 + ... + 1717015636716.
It is an arithmetic number, because the mean of its divisors is an integer number (20604187640208).
Almost surely, 2113323032021111 is an apocalyptic number.
113323032021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113323032021111 is a deficient number, since it is larger than the sum of its proper divisors (51510469100553).
113323032021111 is a wasteful number, since it uses less digits than its factorization.
113323032021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3434031273381.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 113323032021111 its reverse (111120230323311), we get a palindrome (224443262344422).
The spelling of 113323032021111 in words is "one hundred thirteen trillion, three hundred twenty-three billion, thirty-two million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •