Base | Representation |
---|---|
bin | 1101000110101001011… |
… | …0010001100011001111 |
3 | 210112002011202002201221 |
4 | 3101222112101203033 |
5 | 12142022331221333 |
6 | 251230404544211 |
7 | 22156513606204 |
oct | 3215226214317 |
9 | 715064662657 |
10 | 225122523343 |
11 | 87523882893 |
12 | 377690b2067 |
13 | 182c9053cc3 |
14 | ac7883dcab |
15 | 5cc8c99d2d |
hex | 346a5918cf |
225122523343 has 2 divisors, whose sum is σ = 225122523344. Its totient is φ = 225122523342.
The previous prime is 225122523323. The next prime is 225122523371. The reversal of 225122523343 is 343325221522.
225122523343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-225122523343 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 225122523299 and 225122523308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225122523313) 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, 112561261671 + 112561261672.
It is an arithmetic number, because the mean of its divisors is an integer number (112561261672).
Almost surely, 2225122523343 is an apocalyptic number.
225122523343 is a deficient number, since it is larger than the sum of its proper divisors (1).
225122523343 is an equidigital number, since it uses as much as digits as its factorization.
225122523343 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 34.
Adding to 225122523343 its reverse (343325221522), we get a palindrome (568447744865).
The spelling of 225122523343 in words is "two hundred twenty-five billion, one hundred twenty-two million, five hundred twenty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •