Base | Representation |
---|---|
bin | 1010001001010011011111… |
… | …11000011010100001010101 |
3 | 2220222210211212211012100122 |
4 | 11010221233320122201111 |
5 | 10411011222410220333 |
6 | 115241013232521325 |
7 | 4461561020145512 |
oct | 504515770324125 |
9 | 86883755735318 |
10 | 22309937195093 |
11 | 7121655a22949 |
12 | 26039949b0245 |
13 | c5aa833445b2 |
14 | 571b41904309 |
15 | 28a4ecb26798 |
hex | 144a6fe1a855 |
22309937195093 has 2 divisors, whose sum is σ = 22309937195094. Its totient is φ = 22309937195092.
The previous prime is 22309937195087. The next prime is 22309937195111. The reversal of 22309937195093 is 39059173990322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16712250915844 + 5597686279249 = 4088062^2 + 2365943^2 .
It is a cyclic number.
It is not a de Polignac number, because 22309937195093 - 214 = 22309937178709 is a prime.
It is a super-3 number, since 3×223099371950933 (a number of 41 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22309937195023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11154968597546 + 11154968597547.
It is an arithmetic number, because the mean of its divisors is an integer number (11154968597547).
Almost surely, 222309937195093 is an apocalyptic number.
It is an amenable number.
22309937195093 is a deficient number, since it is larger than the sum of its proper divisors (1).
22309937195093 is an equidigital number, since it uses as much as digits as its factorization.
22309937195093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24800580, while the sum is 62.
The spelling of 22309937195093 in words is "twenty-two trillion, three hundred nine billion, nine hundred thirty-seven million, one hundred ninety-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •