Base | Representation |
---|---|
bin | 111001100001111100001010… |
… | …111010001101000000001001 |
3 | 1020011212120102121220111000220 |
4 | 321201330022322031000021 |
5 | 231130444002324420200 |
6 | 2254044124323220253 |
7 | 104203110200220252 |
oct | 7141741272150011 |
9 | 1204776377814026 |
10 | 253021001404425 |
11 | 7369067105a0a1 |
12 | 244651b9517689 |
13 | ab24a164c8b77 |
14 | 466a3d3401b29 |
15 | 1e3b9cc06b4a0 |
hex | e61f0ae8d009 |
253021001404425 has 48 divisors (see below), whose sum is σ = 425202000723072. Its totient is φ = 132727300070400.
The previous prime is 253021001404363. The next prime is 253021001404427. The reversal of 253021001404425 is 524404100120352.
It is a de Polignac number, because none of the positive numbers 2k-253021001404425 is a prime.
It is not an unprimeable number, because it can be changed into a prime (253021001404427) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 121287532 + ... + 123356018.
It is an arithmetic number, because the mean of its divisors is an integer number (8858375015064).
Almost surely, 2253021001404425 is an apocalyptic number.
253021001404425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
253021001404425 is a deficient number, since it is larger than the sum of its proper divisors (172180999318647).
253021001404425 is a wasteful number, since it uses less digits than its factorization.
253021001404425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2095298 (or 2095293 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 253021001404425 its reverse (524404100120352), we get a palindrome (777425101524777).
The spelling of 253021001404425 in words is "two hundred fifty-three trillion, twenty-one billion, one million, four hundred four thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •