Base | Representation |
---|---|
bin | 110100101011010011… |
… | …1101110110000111001 |
3 | 101210222200202121101202 |
4 | 1221112213232300321 |
5 | 3323133313433213 |
6 | 123545005423545 |
7 | 11113164403202 |
oct | 1512647566071 |
9 | 353880677352 |
10 | 113122405433 |
11 | 43a7a715574 |
12 | 19b1056abb5 |
13 | a88a36b19b |
14 | 5691b705a9 |
15 | 2e212b9b58 |
hex | 1a569eec39 |
113122405433 has 8 divisors (see below), whose sum is σ = 116190879360. Its totient is φ = 110054516400.
The previous prime is 113122405399. The next prime is 113122405439. The reversal of 113122405433 is 334504221311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113122405433 is a prime.
It is a super-2 number, since 2×1131224054332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113122405396 and 113122405405.
It is not an unprimeable number, because it can be changed into a prime (113122405439) 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, 261008 + ... + 542558.
It is an arithmetic number, because the mean of its divisors is an integer number (14523859920).
Almost surely, 2113122405433 is an apocalyptic number.
It is an amenable number.
113122405433 is a deficient number, since it is larger than the sum of its proper divisors (3068473927).
113122405433 is a wasteful number, since it uses less digits than its factorization.
113122405433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292447.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 113122405433 its reverse (334504221311), we get a palindrome (447626626744).
The spelling of 113122405433 in words is "one hundred thirteen billion, one hundred twenty-two million, four hundred five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •