Base | Representation |
---|---|
bin | 11001101111010010101001… |
… | …011010011001001111100111 |
3 | 112211210220120100101100220102 |
4 | 121233102221122121033213 |
5 | 104314141122040301043 |
6 | 1040431453245454315 |
7 | 32562334213362455 |
oct | 3157225132311747 |
9 | 484726510340812 |
10 | 113201000322023 |
11 | 330843025a0889 |
12 | 10843141b7139b |
13 | 4b21a68441143 |
14 | 1dd4d59b0b9d5 |
15 | d149401226b8 |
hex | 66f4a96993e7 |
113201000322023 has 4 divisors (see below), whose sum is σ = 113201028095280. Its totient is φ = 113200972548768.
The previous prime is 113201000321999. The next prime is 113201000322043. The reversal of 113201000322023 is 320223000102311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113201000322023 - 210 = 113201000320999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113201000321986 and 113201000322004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113201000322043) 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, 6442658 + ... + 16367951.
It is an arithmetic number, because the mean of its divisors is an integer number (28300257023820).
Almost surely, 2113201000322023 is an apocalyptic number.
113201000322023 is a deficient number, since it is larger than the sum of its proper divisors (27773257).
113201000322023 is an equidigital number, since it uses as much as digits as its factorization.
113201000322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27773256.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 113201000322023 its reverse (320223000102311), we get a palindrome (433424000424334).
The spelling of 113201000322023 in words is "one hundred thirteen trillion, two hundred one billion, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •