Base | Representation |
---|---|
bin | 111001100110001101011010… |
… | …111001111111010111110101 |
3 | 1020012220121202011120120100020 |
4 | 321212031122321333113311 |
5 | 231200300343213131010 |
6 | 2254431010205235353 |
7 | 104233235003210541 |
oct | 7146153271772765 |
9 | 1205817664516306 |
10 | 253314401302005 |
11 | 7379404170779a |
12 | 244b2040562b59 |
13 | ab465a3b28614 |
14 | 467a6a7b62a21 |
15 | 1e444500a4470 |
hex | e6635ae7f5f5 |
253314401302005 has 16 divisors (see below), whose sum is σ = 405303392070720. Its totient is φ = 135100897365248.
The previous prime is 253314401301947. The next prime is 253314401302007. The reversal of 253314401302005 is 500203104413352.
It is a cyclic number.
It is not a de Polignac number, because 253314401302005 - 213 = 253314401293813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253314401302007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12368314 + ... + 25682756.
It is an arithmetic number, because the mean of its divisors is an integer number (25331462004420).
Almost surely, 2253314401302005 is an apocalyptic number.
It is an amenable number.
253314401302005 is a deficient number, since it is larger than the sum of its proper divisors (151988990768715).
253314401302005 is a wasteful number, since it uses less digits than its factorization.
253314401302005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14582820.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 253314401302005 its reverse (500203104413352), we get a palindrome (753517505715357).
The spelling of 253314401302005 in words is "two hundred fifty-three trillion, three hundred fourteen billion, four hundred one million, three hundred two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •