Base | Representation |
---|---|
bin | 100000001001001001… |
… | …001110010101001111 |
3 | 10022002021120202002101 |
4 | 200021021032111033 |
5 | 1031140331320221 |
6 | 23504412335531 |
7 | 2331160642252 |
oct | 401111162517 |
9 | 108067522071 |
10 | 34513151311 |
11 | 13700857451 |
12 | 68324745a7 |
13 | 33403c4932 |
14 | 19559b9099 |
15 | d6ee63d91 |
hex | 80924e54f |
34513151311 has 4 divisors (see below), whose sum is σ = 34514060800. Its totient is φ = 34512241824.
The previous prime is 34513151303. The next prime is 34513151347. The reversal of 34513151311 is 11315131543.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 34513151311 - 23 = 34513151303 is a prime.
It is a super-3 number, since 3×345131513113 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 34513151311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34513151371) 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, 395226 + ... + 474583.
It is an arithmetic number, because the mean of its divisors is an integer number (8628515200).
Almost surely, 234513151311 is an apocalyptic number.
34513151311 is a deficient number, since it is larger than the sum of its proper divisors (909489).
34513151311 is an equidigital number, since it uses as much as digits as its factorization.
34513151311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909488.
The product of its digits is 2700, while the sum is 28.
Adding to 34513151311 its reverse (11315131543), we get a palindrome (45828282854).
The spelling of 34513151311 in words is "thirty-four billion, five hundred thirteen million, one hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •