Base | Representation |
---|---|
bin | 10011000100001010011… |
… | …011100110010011110001 |
3 | 11122020200220121110110211 |
4 | 103010022123212103301 |
5 | 132431131322012431 |
6 | 2441511531424121 |
7 | 163440330346525 |
oct | 23041233462361 |
9 | 4566626543424 |
10 | 1310140032241 |
11 | 465699990527 |
12 | 191ab72b5041 |
13 | 96712b03811 |
14 | 475a815dd85 |
15 | 2412e2442b1 |
hex | 1310a6e64f1 |
1310140032241 has 8 divisors (see below), whose sum is σ = 1379130821120. Its totient is φ = 1241152848432.
The previous prime is 1310140032193. The next prime is 1310140032247. The reversal of 1310140032241 is 1422300410131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1310140032241 - 213 = 1310140024049 is a prime.
It is a super-3 number, since 3×13101400322413 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310140032247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138750 + ... + 1624663.
It is an arithmetic number, because the mean of its divisors is an integer number (172391352640).
Almost surely, 21310140032241 is an apocalyptic number.
It is an amenable number.
1310140032241 is a deficient number, since it is larger than the sum of its proper divisors (68990788879).
1310140032241 is a wasteful number, since it uses less digits than its factorization.
1310140032241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1802535.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1310140032241 its reverse (1422300410131), we get a palindrome (2732440442372).
The spelling of 1310140032241 in words is "one trillion, three hundred ten billion, one hundred forty million, thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •