Base | Representation |
---|---|
bin | 11110011110001010011… |
… | …110001000100110010101 |
3 | 21102011220112011200012112 |
4 | 132132022132020212111 |
5 | 233301423342303001 |
6 | 4241542500000405 |
7 | 304166404160516 |
oct | 36361236104625 |
9 | 7364815150175 |
10 | 2093972228501 |
11 | 738059807a4a |
12 | 2999ab090105 |
13 | 1225cb3034ca |
14 | 734c5152a0d |
15 | 39707e45cbb |
hex | 1e78a788995 |
2093972228501 has 2 divisors, whose sum is σ = 2093972228502. Its totient is φ = 2093972228500.
The previous prime is 2093972228459. The next prime is 2093972228531. The reversal of 2093972228501 is 1058222793902.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1648514763025 + 445457465476 = 1283945^2 + 667426^2 .
It is a cyclic number.
It is not a de Polignac number, because 2093972228501 - 226 = 2093905119637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2093972228501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2093972228531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1046986114250 + 1046986114251.
It is an arithmetic number, because the mean of its divisors is an integer number (1046986114251).
Almost surely, 22093972228501 is an apocalyptic number.
It is an amenable number.
2093972228501 is a deficient number, since it is larger than the sum of its proper divisors (1).
2093972228501 is an equidigital number, since it uses as much as digits as its factorization.
2093972228501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 2093972228501 in words is "two trillion, ninety-three billion, nine hundred seventy-two million, two hundred twenty-eight thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •