Base | Representation |
---|---|
bin | 1001010110111001100111… |
… | …01111110101000001011001 |
3 | 2200212020120010201210220000 |
4 | 10223130303233311001121 |
5 | 10144122324430203342 |
6 | 111433232330523213 |
7 | 4222500265102200 |
oct | 453346357650131 |
9 | 80766503653800 |
10 | 20578056491097 |
11 | 6614117469606 |
12 | 23841b9596509 |
13 | b6366ba0b041 |
14 | 511daa068237 |
15 | 25a43853344c |
hex | 12b733bf5059 |
20578056491097 has 240 divisors, whose sum is σ = 38446506584640. Its totient is φ = 10897324720128.
The previous prime is 20578056491093. The next prime is 20578056491099. The reversal of 20578056491097 is 79019465087502.
20578056491097 is a `hidden beast` number, since 2 + 0 + 5 + 7 + 8 + 0 + 56 + 491 + 0 + 97 = 666.
It is not a de Polignac number, because 20578056491097 - 22 = 20578056491093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (20578056491093) by changing a digit.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 1719273529 + ... + 1719285497.
It is an arithmetic number, because the mean of its divisors is an integer number (160193777436).
Almost surely, 220578056491097 is an apocalyptic number.
20578056491097 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
20578056491097 is a deficient number, since it is larger than the sum of its proper divisors (17868450093543).
20578056491097 is a wasteful number, since it uses less digits than its factorization.
20578056491097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12402 (or 12386 counting only the distinct ones).
The product of its (nonzero) digits is 38102400, while the sum is 63.
The spelling of 20578056491097 in words is "twenty trillion, five hundred seventy-eight billion, fifty-six million, four hundred ninety-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •