Base | Representation |
---|---|
bin | 11001110010110011011110… |
… | …101100100000111101010001 |
3 | 112212122222200202212021022111 |
4 | 121302303132230200331101 |
5 | 104332120030040330413 |
6 | 1041134420321105321 |
7 | 32615641506434542 |
oct | 3162633654407521 |
9 | 485588622767274 |
10 | 113442412433233 |
11 | 33167725421084 |
12 | 10881a96488241 |
13 | 4b3b75c241b20 |
14 | 20028dbb424c9 |
15 | d1ad6e016d3d |
hex | 672cdeb20f51 |
113442412433233 has 16 divisors (see below), whose sum is σ = 122369744301952. Its totient is φ = 104543813808000.
The previous prime is 113442412433197. The next prime is 113442412433263. The reversal of 113442412433233 is 332334214244311.
It is a cyclic number.
It is not a de Polignac number, because 113442412433233 - 29 = 113442412432721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113442412433263) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138394318 + ... + 139211608.
It is an arithmetic number, because the mean of its divisors is an integer number (7648109018872).
Almost surely, 2113442412433233 is an apocalyptic number.
113442412433233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113442412433233 is a deficient number, since it is larger than the sum of its proper divisors (8927331868719).
113442412433233 is a wasteful number, since it uses less digits than its factorization.
113442412433233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834856.
The product of its digits is 497664, while the sum is 40.
Adding to 113442412433233 its reverse (332334214244311), we get a palindrome (445776626677544).
The spelling of 113442412433233 in words is "one hundred thirteen trillion, four hundred forty-two billion, four hundred twelve million, four hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •