Base | Representation |
---|---|
bin | 1100000101010010… |
… | …1010101111011010 |
3 | 22101001001211200011 |
4 | 3001110222233122 |
5 | 23120303430014 |
6 | 1253501432134 |
7 | 143242422556 |
oct | 30124525732 |
9 | 8331054604 |
10 | 3243420634 |
11 | 141490aa23 |
12 | 76626b64a |
13 | 3c8c6230c |
14 | 22aa8c866 |
15 | 13eb287c4 |
hex | c152abda |
3243420634 has 4 divisors (see below), whose sum is σ = 4865130954. Its totient is φ = 1621710316.
The previous prime is 3243420623. The next prime is 3243420643. The reversal of 3243420634 is 4360243423.
3243420634 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 4360243423 = 23 ⋅189575801.
It can be written as a sum of positive squares in only one way, i.e., 2688111409 + 555309225 = 51847^2 + 23565^2 .
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 3243420596 and 3243420605.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 810855157 + ... + 810855160.
Almost surely, 23243420634 is an apocalyptic number.
3243420634 is a deficient number, since it is larger than the sum of its proper divisors (1621710320).
3243420634 is a wasteful number, since it uses less digits than its factorization.
3243420634 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1621710319.
The product of its (nonzero) digits is 41472, while the sum is 31.
The square root of 3243420634 is about 56951.0371635144. The cubic root of 3243420634 is about 1480.2478027364.
The spelling of 3243420634 in words is "three billion, two hundred forty-three million, four hundred twenty thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •