Base | Representation |
---|---|
bin | 1001011001010111000000… |
… | …01101010000011011100010 |
3 | 2201011022122221012111012020 |
4 | 10230223200031100123202 |
5 | 10202013402342442224 |
6 | 111540125115242310 |
7 | 4231551233244153 |
oct | 454534015203342 |
9 | 81138587174166 |
10 | 20662554265314 |
11 | 6646a38235a65 |
12 | 239865b749396 |
13 | b6b61691a500 |
14 | 5161042cd92a |
15 | 25c731800c79 |
hex | 12cae03506e2 |
20662554265314 has 72 divisors (see below), whose sum is σ = 45813358479600. Its totient is φ = 6209854743456.
The previous prime is 20662554265291. The next prime is 20662554265337. The reversal of 20662554265314 is 41356245526602.
It is an interprime number because it is at equal distance from previous prime (20662554265291) and next prime (20662554265337).
It is a super-2 number, since 2×206625542653142 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3635464 + ... + 7385235.
It is an arithmetic number, because the mean of its divisors is an integer number (636296645550).
Almost surely, 220662554265314 is an apocalyptic number.
20662554265314 is an abundant number, since it is smaller than the sum of its proper divisors (25150804214286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20662554265314 is a wasteful number, since it uses less digits than its factorization.
20662554265314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11020816 (or 11020760 counting only the distinct ones).
The product of its (nonzero) digits is 10368000, while the sum is 51.
The spelling of 20662554265314 in words is "twenty trillion, six hundred sixty-two billion, five hundred fifty-four million, two hundred sixty-five thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •