Base | Representation |
---|---|
bin | 111001100010011001101001… |
… | …000101101101011101110001 |
3 | 1020011222121010000021012211120 |
4 | 321202121221011231131301 |
5 | 231132003304420002403 |
6 | 2254110440354132453 |
7 | 104205310322036265 |
oct | 7142315105553561 |
9 | 1204877100235746 |
10 | 253052646250353 |
11 | 736a302a815224 |
12 | 2446b36b281129 |
13 | ab279ba599181 |
14 | 466bb560960a5 |
15 | 1e3c7302a1e53 |
hex | e6266916d771 |
253052646250353 has 32 divisors (see below), whose sum is σ = 350000241840000. Its totient is φ = 162495360345600.
The previous prime is 253052646250321. The next prime is 253052646250399. The reversal of 253052646250353 is 353052646250352.
It is not a de Polignac number, because 253052646250353 - 25 = 253052646250321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 253052646250296 and 253052646250305.
It is not an unprimeable number, because it can be changed into a prime (253052646250553) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82566301 + ... + 85576277.
It is an arithmetic number, because the mean of its divisors is an integer number (10937507557500).
Almost surely, 2253052646250353 is an apocalyptic number.
It is an amenable number.
253052646250353 is a deficient number, since it is larger than the sum of its proper divisors (96947595589647).
253052646250353 is a wasteful number, since it uses less digits than its factorization.
253052646250353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3017617.
The product of its (nonzero) digits is 19440000, while the sum is 51.
Subtracting 253052646250353 from its reverse (353052646250352), we obtain a palindrome (99999999999999).
The spelling of 253052646250353 in words is "two hundred fifty-three trillion, fifty-two billion, six hundred forty-six million, two hundred fifty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •