Base | Representation |
---|---|
bin | 110100110001010010… |
… | …1000001001011011101 |
3 | 101211111200020221020201 |
4 | 1221202211001023131 |
5 | 3324041143133041 |
6 | 124020533343501 |
7 | 11121151533250 |
oct | 1514245011335 |
9 | 354450227221 |
10 | 113323021021 |
11 | 44072988a81 |
12 | 19b67797b91 |
13 | a8bcaac732 |
14 | 56b0673097 |
15 | 2e33be6631 |
hex | 1a629412dd |
113323021021 has 8 divisors (see below), whose sum is σ = 129574097280. Its totient is φ = 97087463088.
The previous prime is 113323020989. The next prime is 113323021081. The reversal of 113323021021 is 120120323311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113323021021 - 25 = 113323020989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113323021021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323021081) 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, 3863926 + ... + 3893143.
It is an arithmetic number, because the mean of its divisors is an integer number (16196762160).
Almost surely, 2113323021021 is an apocalyptic number.
It is an amenable number.
113323021021 is a deficient number, since it is larger than the sum of its proper divisors (16251076259).
113323021021 is an equidigital number, since it uses as much as digits as its factorization.
113323021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7759163.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113323021021 its reverse (120120323311), we get a palindrome (233443344332).
The spelling of 113323021021 in words is "one hundred thirteen billion, three hundred twenty-three million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •