Base | Representation |
---|---|
bin | 11000001100010101100… |
… | …10010001001001111001 |
3 | 2221110121201221000201122 |
4 | 30012022302101021321 |
5 | 102104403310341101 |
6 | 1433512500555025 |
7 | 114025216643600 |
oct | 14061262211171 |
9 | 2843551830648 |
10 | 831257121401 |
11 | 2a0596a79733 |
12 | 11512a3b2a75 |
13 | 60505915895 |
14 | 2c33972ca37 |
15 | 1695248b51b |
hex | c18ac91279 |
831257121401 has 12 divisors (see below), whose sum is σ = 1000316453220. Its totient is φ = 687936926880.
The previous prime is 831257121377. The next prime is 831257121413. The reversal of 831257121401 is 104121752138.
It can be written as a sum of positive squares in 2 ways, for example, as 579128610025 + 252128511376 = 761005^2 + 502124^2 .
It is a de Polignac number, because none of the positive numbers 2k-831257121401 is a prime.
It is not an unprimeable number, because it can be changed into a prime (831257121421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 292488770 + ... + 292491611.
It is an arithmetic number, because the mean of its divisors is an integer number (83359704435).
Almost surely, 2831257121401 is an apocalyptic number.
It is an amenable number.
831257121401 is a deficient number, since it is larger than the sum of its proper divisors (169059331819).
831257121401 is a wasteful number, since it uses less digits than its factorization.
831257121401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584980424 (or 584980417 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 35.
Adding to 831257121401 its reverse (104121752138), we get a palindrome (935378873539).
The spelling of 831257121401 in words is "eight hundred thirty-one billion, two hundred fifty-seven million, one hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •