Base | Representation |
---|---|
bin | 11111110000101100… |
… | …110001110001011001 |
3 | 10021000200212222122210 |
4 | 133300230301301121 |
5 | 1024320334303423 |
6 | 23400002305333 |
7 | 2315051031561 |
oct | 376054616131 |
9 | 107020788583 |
10 | 34103041113 |
11 | 135103065a9 |
12 | 6739058249 |
13 | 32a645358b |
14 | 1917341da1 |
15 | d48e54b93 |
hex | 7f0b31c59 |
34103041113 has 4 divisors (see below), whose sum is σ = 45470721488. Its totient is φ = 22735360740.
The previous prime is 34103041111. The next prime is 34103041117. The reversal of 34103041113 is 31114030143.
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 not a de Polignac number, because 34103041113 - 21 = 34103041111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 34103041113.
It is not an unprimeable number, because it can be changed into a prime (34103041111) 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 3 ways as a sum of consecutive naturals, for example, 5683840183 + ... + 5683840188.
It is an arithmetic number, because the mean of its divisors is an integer number (11367680372).
Almost surely, 234103041113 is an apocalyptic number.
It is an amenable number.
34103041113 is a deficient number, since it is larger than the sum of its proper divisors (11367680375).
34103041113 is a wasteful number, since it uses less digits than its factorization.
34103041113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11367680374.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 34103041113 its reverse (31114030143), we get a palindrome (65217071256).
The spelling of 34103041113 in words is "thirty-four billion, one hundred three million, forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •