Base | Representation |
---|---|
bin | 1001010011110110000001… |
… | …00101010000000000000001 |
3 | 2200111012111201022121002012 |
4 | 10221323000211100000001 |
5 | 10140412244022414243 |
6 | 111313104224502305 |
7 | 4212062100151244 |
oct | 451730045200001 |
9 | 80435451277065 |
10 | 20473045123073 |
11 | 658362a271544 |
12 | 236799147a995 |
13 | b567a4bbc59a |
14 | 50ac8762725b |
15 | 25783e398d18 |
hex | 129ec0950001 |
20473045123073 has 2 divisors, whose sum is σ = 20473045123074. Its totient is φ = 20473045123072.
The previous prime is 20473045123067. The next prime is 20473045123117. The reversal of 20473045123073 is 37032154037402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14942801510464 + 5530243612609 = 3865592^2 + 2351647^2 .
It is a cyclic number.
It is not a de Polignac number, because 20473045123073 - 26 = 20473045123009 is a prime.
It is a super-2 number, since 2×204730451230732 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20473045123073.
It is not a weakly prime, because it can be changed into another prime (20473045123373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10236522561536 + 10236522561537.
It is an arithmetic number, because the mean of its divisors is an integer number (10236522561537).
Almost surely, 220473045123073 is an apocalyptic number.
It is an amenable number.
20473045123073 is a deficient number, since it is larger than the sum of its proper divisors (1).
20473045123073 is an equidigital number, since it uses as much as digits as its factorization.
20473045123073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 423360, while the sum is 41.
The spelling of 20473045123073 in words is "twenty trillion, four hundred seventy-three billion, forty-five million, one hundred twenty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •