Base | Representation |
---|---|
bin | 1110101111110100010… |
… | …0111010010000111111 |
3 | 220012221200022000220012 |
4 | 3223331010322100333 |
5 | 13122332112313142 |
6 | 312220024013435 |
7 | 24206230455233 |
oct | 3537504722077 |
9 | 805850260805 |
10 | 253354026047 |
11 | 984a0819701 |
12 | 4112790127b |
13 | 1ab77c08ca5 |
14 | c3960525c3 |
15 | 68cc4de882 |
hex | 3afd13a43f |
253354026047 has 8 divisors (see below), whose sum is σ = 254834140176. Its totient is φ = 251874092032.
The previous prime is 253354026007. The next prime is 253354026061. The reversal of 253354026047 is 740620453352.
It is a happy number.
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 253354026047 - 224 = 253337248831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 253354025995 and 253354026013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253354026007) 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, 3663968 + ... + 3732474.
It is an arithmetic number, because the mean of its divisors is an integer number (31854267522).
Almost surely, 2253354026047 is an apocalyptic number.
253354026047 is a deficient number, since it is larger than the sum of its proper divisors (1480114129).
253354026047 is a wasteful number, since it uses less digits than its factorization.
253354026047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90057.
The product of its (nonzero) digits is 604800, while the sum is 41.
Adding to 253354026047 its reverse (740620453352), we get a palindrome (993974479399).
The spelling of 253354026047 in words is "two hundred fifty-three billion, three hundred fifty-four million, twenty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •