Base | Representation |
---|---|
bin | 10111100000110100011101… |
… | …011110001010111011000001 |
3 | 111120010221101010001100211002 |
4 | 113200310131132022323001 |
5 | 102023234021020042423 |
6 | 1003534031514501345 |
7 | 30532104442134425 |
oct | 2740643536127301 |
9 | 446127333040732 |
10 | 103410422034113 |
11 | 2aa4a128374787 |
12 | b721771134855 |
13 | 459173a55916c |
14 | 1b7713c0ccb85 |
15 | be4e20882228 |
hex | 5e0d1d78aec1 |
103410422034113 has 4 divisors (see below), whose sum is σ = 107906527339968. Its totient is φ = 98914316728260.
The previous prime is 103410422034077. The next prime is 103410422034133. The reversal of 103410422034113 is 311430224014301.
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 103410422034113 - 222 = 103410417839809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103410422034133) 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, 2248052652893 + ... + 2248052652938.
It is an arithmetic number, because the mean of its divisors is an integer number (26976631834992).
Almost surely, 2103410422034113 is an apocalyptic number.
It is an amenable number.
103410422034113 is a deficient number, since it is larger than the sum of its proper divisors (4496105305855).
103410422034113 is an equidigital number, since it uses as much as digits as its factorization.
103410422034113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4496105305854.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 103410422034113 its reverse (311430224014301), we get a palindrome (414840646048414).
The spelling of 103410422034113 in words is "one hundred three trillion, four hundred ten billion, four hundred twenty-two million, thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •