Base | Representation |
---|---|
bin | 1101000110011001100… |
… | …0111101111001110101 |
3 | 210111220112210111002001 |
4 | 3101212120331321311 |
5 | 12141403331323222 |
6 | 251220033415301 |
7 | 22155046313551 |
oct | 3214630757165 |
9 | 714815714061 |
10 | 225056120437 |
11 | 8749a349355 |
12 | 3774aa0a531 |
13 | 182b8374845 |
14 | ac6dab6861 |
15 | 5cc302ee27 |
hex | 346663de75 |
225056120437 has 4 divisors (see below), whose sum is σ = 225103178560. Its totient is φ = 225009062316.
The previous prime is 225056120357. The next prime is 225056120459. The reversal of 225056120437 is 734021650522.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-225056120437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 225056120396 and 225056120405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225056120467) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23521887 + ... + 23531452.
It is an arithmetic number, because the mean of its divisors is an integer number (56275794640).
Almost surely, 2225056120437 is an apocalyptic number.
It is an amenable number.
225056120437 is a deficient number, since it is larger than the sum of its proper divisors (47058123).
225056120437 is an equidigital number, since it uses as much as digits as its factorization.
225056120437 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47058122.
The product of its (nonzero) digits is 100800, while the sum is 37.
Adding to 225056120437 its reverse (734021650522), we get a palindrome (959077770959).
The spelling of 225056120437 in words is "two hundred twenty-five billion, fifty-six million, one hundred twenty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •