Base | Representation |
---|---|
bin | 11011110001010001010101… |
… | …110101100011011000110001 |
3 | 121000102210221211110021000212 |
4 | 123301101111311203120301 |
5 | 112002012122303142433 |
6 | 1111431104014353505 |
7 | 34503553551140012 |
oct | 3361212565433061 |
9 | 530383854407025 |
10 | 122133130130993 |
11 | 35a08407a55943 |
12 | 118462761bb895 |
13 | 531c1491b0387 |
14 | 22233bc9c7009 |
15 | e1be6a192d48 |
hex | 6f1455d63631 |
122133130130993 has 2 divisors, whose sum is σ = 122133130130994. Its totient is φ = 122133130130992.
The previous prime is 122133130130959. The next prime is 122133130131043. The reversal of 122133130130993 is 399031031331221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114690884240689 + 7442245890304 = 10709383^2 + 2728048^2 .
It is a cyclic number.
It is not a de Polignac number, because 122133130130993 - 26 = 122133130130929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122133130130993.
It is not a weakly prime, because it can be changed into another prime (122133130136993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61066565065496 + 61066565065497.
It is an arithmetic number, because the mean of its divisors is an integer number (61066565065497).
Almost surely, 2122133130130993 is an apocalyptic number.
It is an amenable number.
122133130130993 is a deficient number, since it is larger than the sum of its proper divisors (1).
122133130130993 is an equidigital number, since it uses as much as digits as its factorization.
122133130130993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78732, while the sum is 41.
The spelling of 122133130130993 in words is "one hundred twenty-two trillion, one hundred thirty-three billion, one hundred thirty million, one hundred thirty thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •