Base | Representation |
---|---|
bin | 1001001101101111111111… |
… | …01110110101100000111111 |
3 | 2122202012000200201100000010 |
4 | 10212313333232311200333 |
5 | 10123444424202000020 |
6 | 111032554242234303 |
7 | 4161000111203454 |
oct | 446677756654077 |
9 | 78665020640003 |
10 | 20263651203135 |
11 | 650284791724a |
12 | 2333293955993 |
13 | b3cb1462a102 |
14 | 500aa1aad82b |
15 | 252186385de0 |
hex | 126dffbb583f |
20263651203135 has 8 divisors (see below), whose sum is σ = 32421841925040. Its totient is φ = 10807280641664.
The previous prime is 20263651203101. The next prime is 20263651203139. The reversal of 20263651203135 is 53130215636202.
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 20263651203135 - 224 = 20263634425919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20263651203093 and 20263651203102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20263651203139) 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, 675455040090 + ... + 675455040119.
It is an arithmetic number, because the mean of its divisors is an integer number (4052730240630).
Almost surely, 220263651203135 is an apocalyptic number.
20263651203135 is a deficient number, since it is larger than the sum of its proper divisors (12158190721905).
20263651203135 is a wasteful number, since it uses less digits than its factorization.
20263651203135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1350910080217.
The product of its (nonzero) digits is 194400, while the sum is 39.
Adding to 20263651203135 its reverse (53130215636202), we get a palindrome (73393866839337).
The spelling of 20263651203135 in words is "twenty trillion, two hundred sixty-three billion, six hundred fifty-one million, two hundred three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •