Base | Representation |
---|---|
bin | 1001000110001110101000… |
… | …10111111010100110101111 |
3 | 2121211110222120121102122121 |
4 | 10203013110113322212233 |
5 | 10110231200242032443 |
6 | 110314135051453411 |
7 | 4133221100034421 |
oct | 443072427724657 |
9 | 77743876542577 |
10 | 20005225736623 |
11 | 6413194436336 |
12 | 22b1191757267 |
13 | b2163bb3b19a |
14 | 4d23882c0811 |
15 | 24a5ada2c4ed |
hex | 1231d45fa9af |
20005225736623 has 4 divisors (see below), whose sum is σ = 21058132354360. Its totient is φ = 18952319118888.
The previous prime is 20005225736621. The next prime is 20005225736689. The reversal of 20005225736623 is 32663752250002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20005225736623 - 21 = 20005225736621 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20005225736623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20005225736621) 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, 526453308840 + ... + 526453308877.
It is an arithmetic number, because the mean of its divisors is an integer number (5264533088590).
Almost surely, 220005225736623 is an apocalyptic number.
20005225736623 is a deficient number, since it is larger than the sum of its proper divisors (1052906617737).
20005225736623 is a wasteful number, since it uses less digits than its factorization.
20005225736623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1052906617736.
The product of its (nonzero) digits is 907200, while the sum is 43.
Adding to 20005225736623 its reverse (32663752250002), we get a palindrome (52668977986625).
The spelling of 20005225736623 in words is "twenty trillion, five billion, two hundred twenty-five million, seven hundred thirty-six thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •