Base | Representation |
---|---|
bin | 1001001101010001110010… |
… | …00011101101001111101101 |
3 | 2122200122011102111122202011 |
4 | 10212220321003231033231 |
5 | 10123213220333401123 |
6 | 111021313052201221 |
7 | 4156554160514602 |
oct | 446507103551755 |
9 | 78618142448664 |
10 | 20247433106413 |
11 | 64a6985159127 |
12 | 2330108469211 |
13 | b3b42b621886 |
14 | 4ddda3ba86a9 |
15 | 251a3765de0d |
hex | 126a390ed3ed |
20247433106413 has 4 divisors (see below), whose sum is σ = 20945620454940. Its totient is φ = 19549245757888.
The previous prime is 20247433106363. The next prime is 20247433106491. The reversal of 20247433106413 is 31460133474202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17449484398564 + 2797948707849 = 4177258^2 + 1672707^2 .
It is a cyclic number.
It is not a de Polignac number, because 20247433106413 - 221 = 20247431009261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20247433109413) 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, 349093674220 + ... + 349093674277.
It is an arithmetic number, because the mean of its divisors is an integer number (5236405113735).
Almost surely, 220247433106413 is an apocalyptic number.
It is an amenable number.
20247433106413 is a deficient number, since it is larger than the sum of its proper divisors (698187348527).
20247433106413 is an equidigital number, since it uses as much as digits as its factorization.
20247433106413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 698187348526.
The product of its (nonzero) digits is 290304, while the sum is 40.
The spelling of 20247433106413 in words is "twenty trillion, two hundred forty-seven billion, four hundred thirty-three million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •