Base | Representation |
---|---|
bin | 11111101011010110… |
… | …010000111101000001 |
3 | 10020210102221022010110 |
4 | 133223112100331001 |
5 | 1024124343102231 |
6 | 23343034021533 |
7 | 2312610612126 |
oct | 375326207501 |
9 | 106712838113 |
10 | 34013253441 |
11 | 1347465a812 |
12 | 6712b778a9 |
13 | 329097718b |
14 | 190944c74d |
15 | d4111b046 |
hex | 7eb590f41 |
34013253441 has 4 divisors (see below), whose sum is σ = 45351004592. Its totient is φ = 22675502292.
The previous prime is 34013253401. The next prime is 34013253457. The reversal of 34013253441 is 14435231043.
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 34013253441 - 29 = 34013252929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34013253399 and 34013253408.
It is not an unprimeable number, because it can be changed into a prime (34013253401) 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, 5668875571 + ... + 5668875576.
It is an arithmetic number, because the mean of its divisors is an integer number (11337751148).
Almost surely, 234013253441 is an apocalyptic number.
It is an amenable number.
34013253441 is a deficient number, since it is larger than the sum of its proper divisors (11337751151).
34013253441 is a wasteful number, since it uses less digits than its factorization.
34013253441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11337751150.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 34013253441 its reverse (14435231043), we get a palindrome (48448484484).
The spelling of 34013253441 in words is "thirty-four billion, thirteen million, two hundred fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •