Base | Representation |
---|---|
bin | 1110010010110110100100… |
… | …11111000110101010100101 |
3 | 11010022001220121200202001220 |
4 | 13021123102133012222211 |
5 | 13110004020110310003 |
6 | 150504343243010553 |
7 | 6423016231535112 |
oct | 711332237065245 |
9 | 133261817622056 |
10 | 31434102041253 |
11 | a01a14513170a |
12 | 3638181209a59 |
13 | 14702b9209552 |
14 | 7a95c0b17909 |
15 | 397a16c42353 |
hex | 1c96d27c6aa5 |
31434102041253 has 8 divisors (see below), whose sum is σ = 41913997996416. Its totient is φ = 20955137056800.
The previous prime is 31434102041219. The next prime is 31434102041333. The reversal of 31434102041253 is 35214020143413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31434102041253 - 229 = 31433565170341 is a prime.
It is a super-2 number, since 2×314341020412532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31434102045253) 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, 232663888 + ... + 232798953.
It is an arithmetic number, because the mean of its divisors is an integer number (5239249749552).
Almost surely, 231434102041253 is an apocalyptic number.
It is an amenable number.
31434102041253 is a deficient number, since it is larger than the sum of its proper divisors (10479895955163).
31434102041253 is a wasteful number, since it uses less digits than its factorization.
31434102041253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465485355.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 31434102041253 its reverse (35214020143413), we get a palindrome (66648122184666).
The spelling of 31434102041253 in words is "thirty-one trillion, four hundred thirty-four billion, one hundred two million, forty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.013 sec. • engine limits •