Base | Representation |
---|---|
bin | 1001010000101100110100… |
… | …01101000000110010101011 |
3 | 2200002212200202021002001200 |
4 | 10220112122031000302223 |
5 | 10132130033411141330 |
6 | 111151321514415243 |
7 | 4201216232541312 |
oct | 450263215006253 |
9 | 80085622232050 |
10 | 20365027052715 |
11 | 6541839946514 |
12 | 234aa66431523 |
13 | b4954c1b0a17 |
14 | 50595b757279 |
15 | 254b1b294a60 |
hex | 12859a340cab |
20365027052715 has 48 divisors (see below), whose sum is σ = 35650811495520. Its totient is φ = 10753226726400.
The previous prime is 20365027052659. The next prime is 20365027052717. The reversal of 20365027052715 is 51725072056302.
20365027052715 is a `hidden beast` number, since 2 + 0 + 3 + 6 + 50 + 2 + 70 + 527 + 1 + 5 = 666.
It is not a de Polignac number, because 20365027052715 - 28 = 20365027052459 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (20365027052717) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 91302196 + ... + 91524974.
It is an arithmetic number, because the mean of its divisors is an integer number (742725239490).
Almost surely, 220365027052715 is an apocalyptic number.
20365027052715 is a deficient number, since it is larger than the sum of its proper divisors (15285784442805).
20365027052715 is a wasteful number, since it uses less digits than its factorization.
20365027052715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243004 (or 243001 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The spelling of 20365027052715 in words is "twenty trillion, three hundred sixty-five billion, twenty-seven million, fifty-two thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •