Base | Representation |
---|---|
bin | 1001000110110010000010… |
… | …01001011000101001011001 |
3 | 2121220022001001110010002002 |
4 | 10203121001021120221121 |
5 | 10111034111002410431 |
6 | 110331000550050345 |
7 | 4134463046003423 |
oct | 443310111305131 |
9 | 77808031403062 |
10 | 20024230513241 |
11 | 6420257104299 |
12 | 22b49b63499b5 |
13 | b2337a28bb36 |
14 | 4d326c33d813 |
15 | 24ad2220c3cb |
hex | 123641258a59 |
20024230513241 has 4 divisors (see below), whose sum is σ = 20894849231232. Its totient is φ = 19153611795252.
The previous prime is 20024230513193. The next prime is 20024230513319. The reversal of 20024230513241 is 14231503242002.
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 20024230513241 - 210 = 20024230512217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20024230510241) 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, 435309358961 + ... + 435309359006.
It is an arithmetic number, because the mean of its divisors is an integer number (5223712307808).
Almost surely, 220024230513241 is an apocalyptic number.
It is an amenable number.
20024230513241 is a deficient number, since it is larger than the sum of its proper divisors (870618717991).
20024230513241 is an equidigital number, since it uses as much as digits as its factorization.
20024230513241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870618717990.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 20024230513241 its reverse (14231503242002), we get a palindrome (34255733755243).
The spelling of 20024230513241 in words is "twenty trillion, twenty-four billion, two hundred thirty million, five hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •