Base | Representation |
---|---|
bin | 10010101010000011… |
… | …110101011000110101 |
3 | 1220201010121220010111 |
4 | 102222003311120311 |
5 | 312011422013023 |
6 | 13111504423021 |
7 | 1306302461524 |
oct | 225203653065 |
9 | 56633556114 |
10 | 20033001013 |
11 | 855011a193 |
12 | 3a71017a71 |
13 | 1b7349086c |
14 | d808364bb |
15 | 7c3ad900d |
hex | 4aa0f5635 |
20033001013 has 2 divisors, whose sum is σ = 20033001014. Its totient is φ = 20033001012.
The previous prime is 20033001007. The next prime is 20033001047. The reversal of 20033001013 is 31010033002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12646801764 + 7386199249 = 112458^2 + 85943^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20033001013 is a prime.
It is a super-2 number, since 2×200330010132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20033000984 and 20033001002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20033001083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10016500506 + 10016500507.
It is an arithmetic number, because the mean of its divisors is an integer number (10016500507).
Almost surely, 220033001013 is an apocalyptic number.
It is an amenable number.
20033001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20033001013 is an equidigital number, since it uses as much as digits as its factorization.
20033001013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 20033001013 its reverse (31010033002), we get a palindrome (51043034015).
The spelling of 20033001013 in words is "twenty billion, thirty-three million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •