Base | Representation |
---|---|
bin | 1001011001010011001011… |
… | …10101011100000110101101 |
3 | 2201011010100212000000212020 |
4 | 10230221211311130012231 |
5 | 10202000201301420300 |
6 | 111535145255100353 |
7 | 4231446323423646 |
oct | 454514565340655 |
9 | 81133325000766 |
10 | 20660501201325 |
11 | 6646084345667 |
12 | 23981880716b9 |
13 | b6b37a48424b |
14 | 515d8b7806cd |
15 | 25c66145a8a0 |
hex | 12ca65d5c1ad |
20660501201325 has 24 divisors (see below), whose sum is σ = 34158828183168. Its totient is φ = 11018891114880.
The previous prime is 20660501201293. The next prime is 20660501201369. The reversal of 20660501201325 is 52310210506602.
It is not a de Polignac number, because 20660501201325 - 25 = 20660501201293 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31800684 + ... + 32443866.
It is an arithmetic number, because the mean of its divisors is an integer number (1423284507632).
Almost surely, 220660501201325 is an apocalyptic number.
20660501201325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20660501201325 is a deficient number, since it is larger than the sum of its proper divisors (13498326981843).
20660501201325 is a wasteful number, since it uses less digits than its factorization.
20660501201325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1071493 (or 1071488 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 20660501201325 its reverse (52310210506602), we get a palindrome (72970711707927).
The spelling of 20660501201325 in words is "twenty trillion, six hundred sixty billion, five hundred one million, two hundred one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •