Base | Representation |
---|---|
bin | 1001001010010110010001… |
… | …00000000000000100010101 |
3 | 2122100000022101010211211000 |
4 | 10211023020200000010111 |
5 | 10120041031133402300 |
6 | 110503143255533513 |
7 | 4146361335201615 |
oct | 445131040000425 |
9 | 78300271124730 |
10 | 20146760450325 |
11 | 646821405a603 |
12 | 23146b138a299 |
13 | b31aa6657aa2 |
14 | 4d917368aa45 |
15 | 24e0e4353c00 |
hex | 1252c8800115 |
20146760450325 has 96 divisors (see below), whose sum is σ = 38968623209600. Its totient is φ = 10176707496960.
The previous prime is 20146760450303. The next prime is 20146760450359. The reversal of 20146760450325 is 52305406764102.
20146760450325 is a `hidden beast` number, since 2 + 0 + 1 + 4 + 6 + 7 + 604 + 5 + 0 + 32 + 5 = 666.
It is not a de Polignac number, because 20146760450325 - 29 = 20146760449813 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 48438147 + ... + 48852303.
Almost surely, 220146760450325 is an apocalyptic number.
20146760450325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20146760450325 is a deficient number, since it is larger than the sum of its proper divisors (18821862759275).
20146760450325 is a wasteful number, since it uses less digits than its factorization.
20146760450325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417988 (or 417977 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 45.
The spelling of 20146760450325 in words is "twenty trillion, one hundred forty-six billion, seven hundred sixty million, four hundred fifty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •