Base | Representation |
---|---|
bin | 1001010000110000001100… |
… | …00101100011000101100110 |
3 | 2200010001100220001201111011 |
4 | 10220120012011203011212 |
5 | 10132142240240112431 |
6 | 111152221252532434 |
7 | 4201312131253543 |
oct | 450300605430546 |
9 | 80101326051434 |
10 | 20366837035366 |
11 | 65425885a9248 |
12 | 234b29062111a |
13 | b4977a187783 |
14 | 505a8dcabbca |
15 | 254bc5120cb1 |
hex | 128606163166 |
20366837035366 has 8 divisors (see below), whose sum is σ = 30752575126704. Its totient is φ = 10115978659800.
The previous prime is 20366837035297. The next prime is 20366837035367. The reversal of 20366837035366 is 66353073866302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×203668370353662 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20366837035366.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20366837035367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33719928565 + ... + 33719929168.
It is an arithmetic number, because the mean of its divisors is an integer number (3844071890838).
Almost surely, 220366837035366 is an apocalyptic number.
20366837035366 is a deficient number, since it is larger than the sum of its proper divisors (10385738091338).
20366837035366 is a wasteful number, since it uses less digits than its factorization.
20366837035366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67439857886.
The product of its (nonzero) digits is 58786560, while the sum is 58.
The spelling of 20366837035366 in words is "twenty trillion, three hundred sixty-six billion, eight hundred thirty-seven million, thirty-five thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •