Base | Representation |
---|---|
bin | 110100110001010011… |
… | …0010101000010111111 |
3 | 101211111200220101110202 |
4 | 1221202212111002333 |
5 | 3324041240131133 |
6 | 124020544554115 |
7 | 11121154463624 |
oct | 1514246250277 |
9 | 354450811422 |
10 | 113323364543 |
11 | 440730a3084 |
12 | 19b6792293b |
13 | a8bcb9cbbc |
14 | 56b072234b |
15 | 2e33c632e8 |
hex | 1a629950bf |
113323364543 has 8 divisors (see below), whose sum is σ = 113818530240. Its totient is φ = 112828374400.
The previous prime is 113323364521. The next prime is 113323364563. The reversal of 113323364543 is 345463323311.
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-113323364543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113323364497 and 113323364506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323364513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1345571 + ... + 1427307.
It is an arithmetic number, because the mean of its divisors is an integer number (14227316280).
Almost surely, 2113323364543 is an apocalyptic number.
113323364543 is a deficient number, since it is larger than the sum of its proper divisors (495165697).
113323364543 is an equidigital number, since it uses as much as digits as its factorization.
113323364543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87777.
The product of its digits is 233280, while the sum is 38.
Adding to 113323364543 its reverse (345463323311), we get a palindrome (458786687854).
The spelling of 113323364543 in words is "one hundred thirteen billion, three hundred twenty-three million, three hundred sixty-four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •