Base | Representation |
---|---|
bin | 1001001001010110001000… |
… | …10010011010001111111001 |
3 | 2122012201102212020210110012 |
4 | 10210223010102122033321 |
5 | 10114010022442242223 |
6 | 110435251000431305 |
7 | 4144032200430530 |
oct | 444530422321771 |
9 | 78181385223405 |
10 | 20112330040313 |
11 | 6454655a869a5 |
12 | 2309aa2778535 |
13 | b2b77a443204 |
14 | 4d7628a8d317 |
15 | 24d27b7d5c78 |
hex | 124ac449a3f9 |
20112330040313 has 4 divisors (see below), whose sum is σ = 22985520046080. Its totient is φ = 17239140034548.
The previous prime is 20112330040307. The next prime is 20112330040321. The reversal of 20112330040313 is 31304003321102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20112330040313 - 212 = 20112330036217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112330040333) 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, 1436595002873 + ... + 1436595002886.
It is an arithmetic number, because the mean of its divisors is an integer number (5746380011520).
Almost surely, 220112330040313 is an apocalyptic number.
It is an amenable number.
20112330040313 is a deficient number, since it is larger than the sum of its proper divisors (2873190005767).
20112330040313 is an equidigital number, since it uses as much as digits as its factorization.
20112330040313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2873190005766.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20112330040313 its reverse (31304003321102), we get a palindrome (51416333361415).
The spelling of 20112330040313 in words is "twenty trillion, one hundred twelve billion, three hundred thirty million, forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •