Base | Representation |
---|---|
bin | 11001110001000100100011… |
… | …101100101110101010111111 |
3 | 112212020121021101120020222202 |
4 | 121301010203230232222333 |
5 | 104323142120111024043 |
6 | 1041004002124502115 |
7 | 32604224201306600 |
oct | 3161044354565277 |
9 | 485217241506882 |
10 | 113323311033023 |
11 | 33121167822313 |
12 | 108629976aa93b |
13 | 4b3045b280a10 |
14 | 1ddac3dcadda7 |
15 | d17becdb31b8 |
hex | 671123b2eabf |
113323311033023 has 12 divisors (see below), whose sum is σ = 141965466569640. Its totient is φ = 89662399937712.
The previous prime is 113323311033001. The next prime is 113323311033041. The reversal of 113323311033023 is 320330113323311.
It is not a de Polignac number, because 113323311033023 - 222 = 113323306838719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323311033073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 88950792953 + ... + 88950794226.
It is an arithmetic number, because the mean of its divisors is an integer number (11830455547470).
Almost surely, 2113323311033023 is an apocalyptic number.
113323311033023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113323311033023 is a deficient number, since it is larger than the sum of its proper divisors (28642155536617).
113323311033023 is a wasteful number, since it uses less digits than its factorization.
113323311033023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177901587206 (or 177901587199 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 113323311033023 its reverse (320330113323311), we get a palindrome (433653424356334).
The spelling of 113323311033023 in words is "one hundred thirteen trillion, three hundred twenty-three billion, three hundred eleven million, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •