Base | Representation |
---|---|
bin | 1001000110001011011100… |
… | …10010111110011010100001 |
3 | 2121211022120020002210200111 |
4 | 10203011232102332122201 |
5 | 10110214143332243343 |
6 | 110313253113251321 |
7 | 4133130463313545 |
oct | 443055622763241 |
9 | 77738506083614 |
10 | 20003513165473 |
11 | 6412495767282 |
12 | 22b0994103b41 |
13 | b214280ac986 |
14 | 4d2264a85a25 |
15 | 24a50d4e3c9d |
hex | 12316e4be6a1 |
20003513165473 has 2 divisors, whose sum is σ = 20003513165474. Its totient is φ = 20003513165472.
The previous prime is 20003513165453. The next prime is 20003513165501. The reversal of 20003513165473 is 37456131530002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12345054683809 + 7658458481664 = 3513553^2 + 2767392^2 .
It is a cyclic number.
It is not a de Polignac number, because 20003513165473 - 233 = 19994923230881 is a prime.
It is a super-2 number, since 2×200035131654732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20003513165453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001756582736 + 10001756582737.
It is an arithmetic number, because the mean of its divisors is an integer number (10001756582737).
Almost surely, 220003513165473 is an apocalyptic number.
It is an amenable number.
20003513165473 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003513165473 is an equidigital number, since it uses as much as digits as its factorization.
20003513165473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 226800, while the sum is 40.
Adding to 20003513165473 its reverse (37456131530002), we get a palindrome (57459644695475).
The spelling of 20003513165473 in words is "twenty trillion, three billion, five hundred thirteen million, one hundred sixty-five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •