Base | Representation |
---|---|
bin | 110100101010101010… |
… | …0001011010110100001 |
3 | 101210221011112211010112 |
4 | 1221111110023112201 |
5 | 3323112212034213 |
6 | 123542504141105 |
7 | 11112510260102 |
oct | 1512524132641 |
9 | 353834484115 |
10 | 113100502433 |
11 | 43a69315516 |
12 | 19b05167795 |
13 | a88596c829 |
14 | 568ccac3a9 |
15 | 2e1e3deea8 |
hex | 1a5550b5a1 |
113100502433 has 8 divisors (see below), whose sum is σ = 114728959296. Its totient is φ = 111473031600.
The previous prime is 113100502421. The next prime is 113100502447. The reversal of 113100502433 is 334205001311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113100502433 - 26 = 113100502369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113100502399 and 113100502408.
It is not an unprimeable number, because it can be changed into a prime (113100562433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13883 + ... + 475808.
It is an arithmetic number, because the mean of its divisors is an integer number (14341119912).
Almost surely, 2113100502433 is an apocalyptic number.
It is an amenable number.
113100502433 is a deficient number, since it is larger than the sum of its proper divisors (1628456863).
113100502433 is an equidigital number, since it uses as much as digits as its factorization.
113100502433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493015.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 113100502433 its reverse (334205001311), we get a palindrome (447305503744).
The spelling of 113100502433 in words is "one hundred thirteen billion, one hundred million, five hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •