Base | Representation |
---|---|
bin | 1001001101011000100111… |
… | …10101101100011001000001 |
3 | 2122200222122020021020122010 |
4 | 10212230103311230121001 |
5 | 10123243230013040301 |
6 | 111023121212403133 |
7 | 4160044140540204 |
oct | 446542365543101 |
9 | 78628566236563 |
10 | 20251103643201 |
11 | 64a8499074802 |
12 | 23309717764a9 |
13 | b3b894bca932 |
14 | 50023147993b |
15 | 251b9ea055d6 |
hex | 126b13d6c641 |
20251103643201 has 8 divisors (see below), whose sum is σ = 27240422600160. Its totient is φ = 13381260224192.
The previous prime is 20251103643193. The next prime is 20251103643223. The reversal of 20251103643201 is 10234630115202.
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 20251103643201 - 23 = 20251103643193 is a prime.
It is a super-2 number, since 2×202511036432012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20251103643271) 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, 29868884091 + ... + 29868884768.
It is an arithmetic number, because the mean of its divisors is an integer number (3405052825020).
Almost surely, 220251103643201 is an apocalyptic number.
It is an amenable number.
20251103643201 is a deficient number, since it is larger than the sum of its proper divisors (6989318956959).
20251103643201 is a wasteful number, since it uses less digits than its factorization.
20251103643201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59737768975.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 20251103643201 its reverse (10234630115202), we get a palindrome (30485733758403).
The spelling of 20251103643201 in words is "twenty trillion, two hundred fifty-one billion, one hundred three million, six hundred forty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •