Base | Representation |
---|---|
bin | 1001011011111111010101… |
… | …10110000010001111000101 |
3 | 2201110221221011112010200012 |
4 | 10231333222312002033011 |
5 | 10210003443310243303 |
6 | 112045432453400005 |
7 | 4241230610202536 |
oct | 455775266021705 |
9 | 81427834463605 |
10 | 20752927040453 |
11 | 66812a3317583 |
12 | 23b2081339005 |
13 | b76cb9a3b29a |
14 | 51a63890668d |
15 | 25ec707645d8 |
hex | 12dfead823c5 |
20752927040453 has 8 divisors (see below), whose sum is σ = 20959033349016. Its totient is φ = 20546833120000.
The previous prime is 20752927040429. The next prime is 20752927040471. The reversal of 20752927040453 is 35404072925702.
It can be written as a sum of positive squares in 4 ways, for example, as 10771668408484 + 9981258631969 = 3282022^2 + 3159313^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20752927040453 - 224 = 20752910263237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20752927048453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 288353 + ... + 6448953.
It is an arithmetic number, because the mean of its divisors is an integer number (2619879168627).
Almost surely, 220752927040453 is an apocalyptic number.
It is an amenable number.
20752927040453 is a deficient number, since it is larger than the sum of its proper divisors (206106308563).
20752927040453 is a wasteful number, since it uses less digits than its factorization.
20752927040453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6194055.
The product of its (nonzero) digits is 4233600, while the sum is 50.
The spelling of 20752927040453 in words is "twenty trillion, seven hundred fifty-two billion, nine hundred twenty-seven million, forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •