Base | Representation |
---|---|
bin | 1001001101011010010011… |
… | …11100100001010011000001 |
3 | 2122201001222111101012012102 |
4 | 10212231021330201103001 |
5 | 10123302104404334213 |
6 | 111023351241040145 |
7 | 4160105502423446 |
oct | 446551174412301 |
9 | 78631874335172 |
10 | 20252011402433 |
11 | 64a8914516748 |
12 | 2330b85786055 |
13 | b3b9aacacc85 |
14 | 5002b9c559cd |
15 | 251c04566158 |
hex | 126b49f214c1 |
20252011402433 has 8 divisors (see below), whose sum is σ = 20279595011520. Its totient is φ = 20224434890160.
The previous prime is 20252011402429. The next prime is 20252011402453. The reversal of 20252011402433 is 33420411025202.
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 20252011402433 - 22 = 20252011402429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20252011402396 and 20252011402405.
It is not an unprimeable number, because it can be changed into a prime (20252011402453) 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, 3949598 + ... + 7490216.
It is an arithmetic number, because the mean of its divisors is an integer number (2534949376440).
Almost surely, 220252011402433 is an apocalyptic number.
It is an amenable number.
20252011402433 is a deficient number, since it is larger than the sum of its proper divisors (27583609087).
20252011402433 is an equidigital number, since it uses as much as digits as its factorization.
20252011402433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3548407.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 20252011402433 its reverse (33420411025202), we get a palindrome (53672422427635).
The spelling of 20252011402433 in words is "twenty trillion, two hundred fifty-two billion, eleven million, four hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.000 sec. • engine limits •