Base | Representation |
---|---|
bin | 10100110011100101… |
… | …111001101100010101 |
3 | 2010122221102102101112 |
4 | 110303211321230111 |
5 | 331223121111013 |
6 | 14132452304405 |
7 | 1420421232026 |
oct | 246345715425 |
9 | 63587372345 |
10 | 22340410133 |
11 | 9524640878 |
12 | 43b5912105 |
13 | 215052b1c2 |
14 | 111d072c4d |
15 | 8ab470ba8 |
hex | 533979b15 |
22340410133 has 2 divisors, whose sum is σ = 22340410134. Its totient is φ = 22340410132.
The previous prime is 22340410129. The next prime is 22340410171. The reversal of 22340410133 is 33101404322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22277652049 + 62758084 = 149257^2 + 7922^2 .
It is a cyclic number.
It is not a de Polignac number, because 22340410133 - 22 = 22340410129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22340410099 and 22340410108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22340470133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11170205066 + 11170205067.
It is an arithmetic number, because the mean of its divisors is an integer number (11170205067).
Almost surely, 222340410133 is an apocalyptic number.
It is an amenable number.
22340410133 is a deficient number, since it is larger than the sum of its proper divisors (1).
22340410133 is an equidigital number, since it uses as much as digits as its factorization.
22340410133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 22340410133 its reverse (33101404322), we get a palindrome (55441814455).
The spelling of 22340410133 in words is "twenty-two billion, three hundred forty million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •