Base | Representation |
---|---|
bin | 1001010011011101110111… |
… | …00010100110110111110001 |
3 | 2200102222000211221201012102 |
4 | 10221232323202212313301 |
5 | 10140204213331023403 |
6 | 111303121243510145 |
7 | 4211122514324144 |
oct | 451567342466761 |
9 | 80388024851172 |
10 | 20460075642353 |
11 | 6579084341736 |
12 | 2365371b28355 |
13 | b554b8c45039 |
14 | 50a3b6d6405b |
15 | 257330974b88 |
hex | 129bbb8a6df1 |
20460075642353 has 2 divisors, whose sum is σ = 20460075642354. Its totient is φ = 20460075642352.
The previous prime is 20460075642277. The next prime is 20460075642397. The reversal of 20460075642353 is 35324657006402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17797539376369 + 2662536265984 = 4218713^2 + 1631728^2 .
It is a cyclic number.
It is not a de Polignac number, because 20460075642353 - 218 = 20460075380209 is a prime.
It is a super-2 number, since 2×204600756423532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20460075642298 and 20460075642307.
It is not a weakly prime, because it can be changed into another prime (20460075642053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10230037821176 + 10230037821177.
It is an arithmetic number, because the mean of its divisors is an integer number (10230037821177).
Almost surely, 220460075642353 is an apocalyptic number.
It is an amenable number.
20460075642353 is a deficient number, since it is larger than the sum of its proper divisors (1).
20460075642353 is an equidigital number, since it uses as much as digits as its factorization.
20460075642353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3628800, while the sum is 47.
The spelling of 20460075642353 in words is "twenty trillion, four hundred sixty billion, seventy-five million, six hundred forty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •