Base | Representation |
---|---|
bin | 1101000110011100010… |
… | …1010000010010000101 |
3 | 210111221100122022110211 |
4 | 3101213011100102011 |
5 | 12141414314330203 |
6 | 251221130315421 |
7 | 22155250066045 |
oct | 3214705202205 |
9 | 714840568424 |
10 | 225067730053 |
11 | 874a5958881 |
12 | 37752888b71 |
13 | 182ba8aac3a |
14 | ac71459725 |
15 | 5cc4074c6d |
hex | 3467150485 |
225067730053 has 4 divisors (see below), whose sum is σ = 225604884960. Its totient is φ = 224530575148.
The previous prime is 225067730047. The next prime is 225067730081. The reversal of 225067730053 is 350037760522.
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 not a de Polignac number, because 225067730053 - 25 = 225067730021 is a prime.
It is a super-2 number, since 2×2250677300532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 225067729988 and 225067730015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225067130053) 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, 268576825 + ... + 268577662.
It is an arithmetic number, because the mean of its divisors is an integer number (56401221240).
Almost surely, 2225067730053 is an apocalyptic number.
It is an amenable number.
225067730053 is a deficient number, since it is larger than the sum of its proper divisors (537154907).
225067730053 is an equidigital number, since it uses as much as digits as its factorization.
225067730053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537154906.
The product of its (nonzero) digits is 264600, while the sum is 40.
The spelling of 225067730053 in words is "two hundred twenty-five billion, sixty-seven million, seven hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •