Base | Representation |
---|---|
bin | 111001101110011110000000… |
… | …011111110011010001111101 |
3 | 1020021220212201211210121000112 |
4 | 321232132000133303101331 |
5 | 231234100232204412023 |
6 | 2255543433230035405 |
7 | 104322236555462216 |
oct | 7156360037632175 |
9 | 1207825654717015 |
10 | 253881967654013 |
11 | 73992813062526 |
12 | 24584039348b65 |
13 | ab87c7515382a |
14 | 4699d4a6a040d |
15 | 1e540bc827478 |
hex | e6e7807f347d |
253881967654013 has 8 divisors (see below), whose sum is σ = 253911652205568. Its totient is φ = 253852284101904.
The previous prime is 253881967653989. The next prime is 253881967654061. The reversal of 253881967654013 is 310456769188352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 253881967654013 - 216 = 253881967588477 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 (253881967656013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586879631 + ... + 587312067.
It is an arithmetic number, because the mean of its divisors is an integer number (31738956525696).
It is a 1-persistent number, because it is pandigital, but 2⋅253881967654013 = 507763935308026 is not.
Almost surely, 2253881967654013 is an apocalyptic number.
It is an amenable number.
253881967654013 is a deficient number, since it is larger than the sum of its proper divisors (29684551555).
253881967654013 is a wasteful number, since it uses less digits than its factorization.
253881967654013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 499723.
The product of its (nonzero) digits is 261273600, while the sum is 68.
The spelling of 253881967654013 in words is "two hundred fifty-three trillion, eight hundred eighty-one billion, nine hundred sixty-seven million, six hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •