Base | Representation |
---|---|
bin | 111001100111101011100001… |
… | …111001011001110101110001 |
3 | 1020020021021120110010120002012 |
4 | 321213223201321121311301 |
5 | 231203424320240221431 |
6 | 2254545241204332305 |
7 | 104243443045535336 |
oct | 7147534171316561 |
9 | 1206237513116065 |
10 | 253415450320241 |
11 | 738229861a6810 |
12 | 245097416a4095 |
13 | ab52c88a787c1 |
14 | 468153225098d |
15 | 1e46db645422b |
hex | e67ae1e59d71 |
253415450320241 has 8 divisors (see below), whose sum is σ = 282882363148704. Its totient is φ = 225020061594720.
The previous prime is 253415450320213. The next prime is 253415450320259. The reversal of 253415450320241 is 142023054514352.
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 253415450320241 - 214 = 253415450303857 is a prime.
It is a super-2 number, since 2×2534154503202412 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (253412450320241) 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, 267881025236 + ... + 267881026181.
It is an arithmetic number, because the mean of its divisors is an integer number (35360295393588).
Almost surely, 2253415450320241 is an apocalyptic number.
It is an amenable number.
253415450320241 is a deficient number, since it is larger than the sum of its proper divisors (29466912828463).
253415450320241 is a wasteful number, since it uses less digits than its factorization.
253415450320241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535762051471.
The product of its (nonzero) digits is 576000, while the sum is 41.
The spelling of 253415450320241 in words is "two hundred fifty-three trillion, four hundred fifteen billion, four hundred fifty million, three hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •