Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …001101111110110100001 |
3 | 21011002222022000001022012 |
4 | 131121101121233312201 |
5 | 231043430041130332 |
6 | 4143550401322305 |
7 | 265640330350316 |
oct | 35312131576641 |
9 | 7132868001265 |
10 | 2020000333217 |
11 | 70974a588199 |
12 | 2875a6036395 |
13 | 118640027879 |
14 | 6daa8c20d0d |
15 | 37828cb23b2 |
hex | 1d65166fda1 |
2020000333217 has 2 divisors, whose sum is σ = 2020000333218. Its totient is φ = 2020000333216.
The previous prime is 2020000333207. The next prime is 2020000333223. The reversal of 2020000333217 is 7123330000202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1975306567936 + 44693765281 = 1405456^2 + 211409^2 .
It is a cyclic number.
It is not a de Polignac number, because 2020000333217 - 218 = 2020000071073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2020000333192 and 2020000333201.
It is not a weakly prime, because it can be changed into another prime (2020000333207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010000166608 + 1010000166609.
It is an arithmetic number, because the mean of its divisors is an integer number (1010000166609).
Almost surely, 22020000333217 is an apocalyptic number.
It is an amenable number.
2020000333217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2020000333217 is an equidigital number, since it uses as much as digits as its factorization.
2020000333217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 23.
Adding to 2020000333217 its reverse (7123330000202), we get a palindrome (9143330333419).
The spelling of 2020000333217 in words is "two trillion, twenty billion, three hundred thirty-three thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •