Base | Representation |
---|---|
bin | 1110101111101101101… |
… | …0011011000110100101 |
3 | 220012212201202210211210 |
4 | 3223323122123012211 |
5 | 13122302441024031 |
6 | 312213145422033 |
7 | 24205441262535 |
oct | 3537332330645 |
9 | 805781683753 |
10 | 253326111141 |
11 | 98486a92834 |
12 | 4111a49a919 |
13 | 1ab721b40ac |
14 | c3924674c5 |
15 | 68c9d28746 |
hex | 3afb69b1a5 |
253326111141 has 8 divisors (see below), whose sum is σ = 337770868320. Its totient is φ = 168882714032.
The previous prime is 253326111091. The next prime is 253326111151. The reversal of 253326111141 is 141111623352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253326111141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 253326111099 and 253326111108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253326111151) 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 7 ways as a sum of consecutive naturals, for example, 232126 + ... + 748688.
It is an arithmetic number, because the mean of its divisors is an integer number (42221358540).
Almost surely, 2253326111141 is an apocalyptic number.
It is an amenable number.
253326111141 is a deficient number, since it is larger than the sum of its proper divisors (84444757179).
253326111141 is a wasteful number, since it uses less digits than its factorization.
253326111141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680035.
The product of its digits is 4320, while the sum is 30.
Adding to 253326111141 its reverse (141111623352), we get a palindrome (394437734493).
The spelling of 253326111141 in words is "two hundred fifty-three billion, three hundred twenty-six million, one hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •