Base | Representation |
---|---|
bin | 100000110010011000101… |
… | …111110101111010011101 |
3 | 21222101201012012200000212 |
4 | 200302120233311322131 |
5 | 243403400114312113 |
6 | 4443023243502205 |
7 | 321532360051556 |
oct | 40623057657235 |
9 | 7871635180025 |
10 | 2253125541533 |
11 | 7995aa6a1709 |
12 | 304807227965 |
13 | 134613021b09 |
14 | 7b0a242732d |
15 | 3d9203d80a8 |
hex | 20c98bf5e9d |
2253125541533 has 4 divisors (see below), whose sum is σ = 2262102137568. Its totient is φ = 2244148945500.
The previous prime is 2253125541497. The next prime is 2253125541551. The reversal of 2253125541533 is 3351455213522.
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 2253125541533 - 210 = 2253125540509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2253125501533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4488297641 + ... + 4488298142.
It is an arithmetic number, because the mean of its divisors is an integer number (565525534392).
Almost surely, 22253125541533 is an apocalyptic number.
It is an amenable number.
2253125541533 is a deficient number, since it is larger than the sum of its proper divisors (8976596035).
2253125541533 is an equidigital number, since it uses as much as digits as its factorization.
2253125541533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8976596034.
The product of its digits is 540000, while the sum is 41.
The spelling of 2253125541533 in words is "two trillion, two hundred fifty-three billion, one hundred twenty-five million, five hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •