Base | Representation |
---|---|
bin | 100000000100011100… |
… | …011110000100001011 |
3 | 10021212210020012201001 |
4 | 200010130132010023 |
5 | 1031010140413121 |
6 | 23452514435431 |
7 | 2326212544354 |
oct | 400434360413 |
9 | 107783205631 |
10 | 34434310411 |
11 | 136702a8086 |
12 | 680bb92b77 |
13 | 3329c7c007 |
14 | 1949334d2b |
15 | d6808d991 |
hex | 80471e10b |
34434310411 has 2 divisors, whose sum is σ = 34434310412. Its totient is φ = 34434310410.
The previous prime is 34434310409. The next prime is 34434310433. The reversal of 34434310411 is 11401343443.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 34434310411 - 21 = 34434310409 is a prime.
It is a super-2 number, since 2×344343104112 (a number of 22 digits) contains 22 as substring.
Together with 34434310409, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 34434310411.
It is not a weakly prime, because it can be changed into another prime (34434010411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17217155205 + 17217155206.
It is an arithmetic number, because the mean of its divisors is an integer number (17217155206).
Almost surely, 234434310411 is an apocalyptic number.
34434310411 is a deficient number, since it is larger than the sum of its proper divisors (1).
34434310411 is an equidigital number, since it uses as much as digits as its factorization.
34434310411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 34434310411 its reverse (11401343443), we get a palindrome (45835653854).
The spelling of 34434310411 in words is "thirty-four billion, four hundred thirty-four million, three hundred ten thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •