Base | Representation |
---|---|
bin | 1001001110000000100000… |
… | …00100100000101011011001 |
3 | 2122210000220102222211020101 |
4 | 10213000100010200223121 |
5 | 10124121102401130001 |
6 | 111041022005455401 |
7 | 4161432553331332 |
oct | 447002004405331 |
9 | 78700812884211 |
10 | 20272515255001 |
11 | 65065863a3649 |
12 | 2334b48411561 |
13 | b408c7b8b409 |
14 | 5012a3017289 |
15 | 25250465ba01 |
hex | 127010120ad9 |
20272515255001 has 27 divisors (see below), whose sum is σ = 21804582233503. Its totient is φ = 18844227385280.
The previous prime is 20272515254947. The next prime is 20272515255007. The reversal of 20272515255001 is 10055251527202.
It is a happy number.
The square root of 20272515255001 is 4502501.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 15783100112025 + 4489415142976 = 3972795^2 + 2118824^2 .
It is not a de Polignac number, because 20272515255001 - 217 = 20272515123929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20272515255007) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 6353027316 + ... + 6353030506.
Almost surely, 220272515255001 is an apocalyptic number.
20272515255001 is the 4502501-st square number.
20272515255001 is the 2251251-st centered octagonal number.
It is an amenable number.
20272515255001 is a deficient number, since it is larger than the sum of its proper divisors (1532066978502).
20272515255001 is an frugal number, since it uses more digits than its factorization.
20272515255001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6582 (or 3291 counting only the distinct ones).
The product of its (nonzero) digits is 70000, while the sum is 37.
The spelling of 20272515255001 in words is "twenty trillion, two hundred seventy-two billion, five hundred fifteen million, two hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •