Base | Representation |
---|---|
bin | 11001110010111010101010… |
… | …110100110101100101001111 |
3 | 112212200201121202211201020222 |
4 | 121302322222310311211033 |
5 | 104332231332311243343 |
6 | 1041142134325101555 |
7 | 32616334015010453 |
oct | 3162725264654517 |
9 | 485621552751228 |
10 | 113450132134223 |
11 | 3316aa26a50755 |
12 | 1088348b8578bb |
13 | 4b3c3bc694431 |
14 | 20030310c4663 |
15 | d1b171ae5a68 |
hex | 672eaad3594f |
113450132134223 has 4 divisors (see below), whose sum is σ = 113450387782680. Its totient is φ = 113449876485768.
The previous prime is 113450132134211. The next prime is 113450132134271. The reversal of 113450132134223 is 322431231054311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113450132134223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113450132134523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127157408 + ... + 128046501.
It is an arithmetic number, because the mean of its divisors is an integer number (28362596945670).
Almost surely, 2113450132134223 is an apocalyptic number.
113450132134223 is a deficient number, since it is larger than the sum of its proper divisors (255648457).
113450132134223 is an equidigital number, since it uses as much as digits as its factorization.
113450132134223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255648456.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 113450132134223 its reverse (322431231054311), we get a palindrome (435881363188534).
The spelling of 113450132134223 in words is "one hundred thirteen trillion, four hundred fifty billion, one hundred thirty-two million, one hundred thirty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •