Base | Representation |
---|---|
bin | 1100000010101110101001… |
… | …1110010001010011101111 |
3 | 1201212211101122211001012210 |
4 | 3000223222132101103233 |
5 | 3213420103342310111 |
6 | 44054501512101503 |
7 | 2534426615363625 |
oct | 300535236212357 |
9 | 51784348731183 |
10 | 13241023010031 |
11 | 4245539329573 |
12 | 159a247994893 |
13 | 750813c9250b |
14 | 33ac244d1515 |
15 | 17e66931c0a6 |
hex | c0aea7914ef |
13241023010031 has 16 divisors (see below), whose sum is σ = 17734161212768. Its totient is φ = 8787642393600.
The previous prime is 13241023009997. The next prime is 13241023010113. The reversal of 13241023010031 is 13001032014231.
It is not a de Polignac number, because 13241023010031 - 226 = 13240955901167 is a prime.
It is a super-2 number, since 2×132410230100312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13241023020031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1139500 + ... + 5270721.
It is an arithmetic number, because the mean of its divisors is an integer number (1108385075798).
Almost surely, 213241023010031 is an apocalyptic number.
13241023010031 is a deficient number, since it is larger than the sum of its proper divisors (4493138202737).
13241023010031 is a wasteful number, since it uses less digits than its factorization.
13241023010031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6413322.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13241023010031 its reverse (13001032014231), we get a palindrome (26242055024262).
The spelling of 13241023010031 in words is "thirteen trillion, two hundred forty-one billion, twenty-three million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •