Base | Representation |
---|---|
bin | 110011001100011010001011… |
… | …110100111011101111110001 |
3 | 1002112012102120011022211201101 |
4 | 303030122023310323233301 |
5 | 214002402043101001040 |
6 | 2114505525513204401 |
7 | 65265530146355416 |
oct | 6314321364735761 |
9 | 1075172504284641 |
10 | 225153121500145 |
11 | 658169a23a2283 |
12 | 21304224a00701 |
13 | 9882b047cb517 |
14 | 3d8567d7ac10d |
15 | 1b06b392ba09a |
hex | ccc68bd3bbf1 |
225153121500145 has 4 divisors (see below), whose sum is σ = 270183745800180. Its totient is φ = 180122497200112.
The previous prime is 225153121500089. The next prime is 225153121500169. The reversal of 225153121500145 is 541005121351522.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 134145318380544 + 91007803119601 = 11582112^2 + 9539801^2 .
It is a cyclic number.
It is not a de Polignac number, because 225153121500145 - 221 = 225153119402993 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22515312150010 + ... + 22515312150019.
It is an arithmetic number, because the mean of its divisors is an integer number (67545936450045).
Almost surely, 2225153121500145 is an apocalyptic number.
It is an amenable number.
225153121500145 is a deficient number, since it is larger than the sum of its proper divisors (45030624300035).
225153121500145 is an equidigital number, since it uses as much as digits as its factorization.
225153121500145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45030624300034.
The product of its (nonzero) digits is 60000, while the sum is 37.
Adding to 225153121500145 its reverse (541005121351522), we get a palindrome (766158242851667).
The spelling of 225153121500145 in words is "two hundred twenty-five trillion, one hundred fifty-three billion, one hundred twenty-one million, five hundred thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •