Base | Representation |
---|---|
bin | 100000001110100111… |
… | …101011111101000011 |
3 | 10022022200110022102010 |
4 | 200032213223331003 |
5 | 1031332341214133 |
6 | 23521453424003 |
7 | 2333354562003 |
oct | 401647537503 |
9 | 108280408363 |
10 | 34605023043 |
11 | 137486a6aa8 |
12 | 685919b003 |
13 | 33564507c6 |
14 | 1963c92003 |
15 | d78060263 |
hex | 80e9ebf43 |
34605023043 has 4 divisors (see below), whose sum is σ = 46140030728. Its totient is φ = 23070015360.
The previous prime is 34605023009. The next prime is 34605023051. The reversal of 34605023043 is 34032050643.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34032050643 = 3 ⋅11344016881.
It is not a de Polignac number, because 34605023043 - 225 = 34571468611 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 34605023043.
It is not an unprimeable number, because it can be changed into a prime (34605023143) 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, 5767503838 + ... + 5767503843.
It is an arithmetic number, because the mean of its divisors is an integer number (11535007682).
Almost surely, 234605023043 is an apocalyptic number.
34605023043 is a deficient number, since it is larger than the sum of its proper divisors (11535007685).
34605023043 is a wasteful number, since it uses less digits than its factorization.
34605023043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11535007684.
The product of its (nonzero) digits is 25920, while the sum is 30.
Adding to 34605023043 its reverse (34032050643), we get a palindrome (68637073686).
The spelling of 34605023043 in words is "thirty-four billion, six hundred five million, twenty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •