Base | Representation |
---|---|
bin | 11111111110010110… |
… | …001110011101010101 |
3 | 10021121122201211100222 |
4 | 133332112032131111 |
5 | 1030302443312300 |
6 | 23434422044125 |
7 | 2323531162364 |
oct | 377626163525 |
9 | 107548654328 |
10 | 34332010325 |
11 | 13618585558 |
12 | 67a1879645 |
13 | 3311a11612 |
14 | 19399057db |
15 | d5e0d2785 |
hex | 7fe58e755 |
34332010325 has 48 divisors (see below), whose sum is σ = 44831394000. Its totient is φ = 26045859840.
The previous prime is 34332010319. The next prime is 34332010337. The reversal of 34332010325 is 52301023343.
It is a happy number.
It can be written as a sum of positive squares in 24 ways, for example, as 20426412241 + 13905598084 = 142921^2 + 117922^2 .
It is a de Polignac number, because none of the positive numbers 2k-34332010325 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34332010294 and 34332010303.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10128731 + ... + 10132119.
It is an arithmetic number, because the mean of its divisors is an integer number (933987375).
Almost surely, 234332010325 is an apocalyptic number.
It is an amenable number.
34332010325 is a deficient number, since it is larger than the sum of its proper divisors (10499383675).
34332010325 is a wasteful number, since it uses less digits than its factorization.
34332010325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3674 (or 3669 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 26.
Adding to 34332010325 its reverse (52301023343), we get a palindrome (86633033668).
The spelling of 34332010325 in words is "thirty-four billion, three hundred thirty-two million, ten thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •