Base | Representation |
---|---|
bin | 1001001101001101011101… |
… | …01001101111000101110111 |
3 | 2122200102011121010120210011 |
4 | 10212212232221233011313 |
5 | 10123143441411324143 |
6 | 111020250422241051 |
7 | 4156442503350001 |
oct | 446465651570567 |
9 | 78612147116704 |
10 | 20245111042423 |
11 | 64a59a3438083 |
12 | 232b77a886187 |
13 | b3b14b522a07 |
14 | 4ddc23635371 |
15 | 25194d87ee9d |
hex | 1269aea6f177 |
20245111042423 has 8 divisors (see below), whose sum is σ = 20422556629488. Its totient is φ = 20068359959424.
The previous prime is 20245111042421. The next prime is 20245111042447. The reversal of 20245111042423 is 32424011154202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20245111042423 - 21 = 20245111042421 is a prime.
It is a super-2 number, since 2×202451110424232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20245111042421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173567461 + ... + 173684062.
It is an arithmetic number, because the mean of its divisors is an integer number (2552819578686).
Almost surely, 220245111042423 is an apocalyptic number.
20245111042423 is a deficient number, since it is larger than the sum of its proper divisors (177445587065).
20245111042423 is a wasteful number, since it uses less digits than its factorization.
20245111042423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347252033.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 20245111042423 its reverse (32424011154202), we get a palindrome (52669122196625).
The spelling of 20245111042423 in words is "twenty trillion, two hundred forty-five billion, one hundred eleven million, forty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •