Base | Representation |
---|---|
bin | 1001011001111100000011… |
… | …0100101010001010100101 |
3 | 1100121121111111022211222221 |
4 | 2112133000310222022211 |
5 | 2323412310123424031 |
6 | 33554405205552341 |
7 | 2115062050545430 |
oct | 226370064521245 |
9 | 40547444284887 |
10 | 10341221311141 |
11 | 3327761920506 |
12 | 11b02461156b1 |
13 | 5a0233082ca6 |
14 | 27a736b18817 |
15 | 12deeb433a11 |
hex | 967c0d2a2a5 |
10341221311141 has 4 divisors (see below), whose sum is σ = 11818538641312. Its totient is φ = 8863903980972.
The previous prime is 10341221311123. The next prime is 10341221311177. The reversal of 10341221311141 is 14111312214301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10341221311141 - 27 = 10341221311013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10341221311241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 738658665075 + ... + 738658665088.
It is an arithmetic number, because the mean of its divisors is an integer number (2954634660328).
Almost surely, 210341221311141 is an apocalyptic number.
It is an amenable number.
10341221311141 is a deficient number, since it is larger than the sum of its proper divisors (1477317330171).
10341221311141 is an equidigital number, since it uses as much as digits as its factorization.
10341221311141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1477317330170.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 10341221311141 its reverse (14111312214301), we get a palindrome (24452533525442).
The spelling of 10341221311141 in words is "ten trillion, three hundred forty-one billion, two hundred twenty-one million, three hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •