Base | Representation |
---|---|
bin | 1100110010110011… |
… | …0111100101110101 |
3 | 22212100021020021120 |
4 | 3030230313211311 |
5 | 24013141022401 |
6 | 1324441134153 |
7 | 151051121361 |
oct | 31454674565 |
9 | 8770236246 |
10 | 3434314101 |
11 | 1502643019 |
12 | 7ba18a359 |
13 | 42967b62a |
14 | 2481802a1 |
15 | 151784836 |
hex | ccb37975 |
3434314101 has 4 divisors (see below), whose sum is σ = 4579085472. Its totient is φ = 2289542732.
The previous prime is 3434314057. The next prime is 3434314139. The reversal of 3434314101 is 1014134343.
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 a cyclic number.
It is not a de Polignac number, because 3434314101 - 213 = 3434305909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3434314151) 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, 572385681 + ... + 572385686.
It is an arithmetic number, because the mean of its divisors is an integer number (1144771368).
Almost surely, 23434314101 is an apocalyptic number.
It is an amenable number.
3434314101 is a deficient number, since it is larger than the sum of its proper divisors (1144771371).
3434314101 is a wasteful number, since it uses less digits than its factorization.
3434314101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144771370.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 3434314101 is about 58603.0212617063. The cubic root of 3434314101 is about 1508.7362935568.
Adding to 3434314101 its reverse (1014134343), we get a palindrome (4448448444).
The spelling of 3434314101 in words is "three billion, four hundred thirty-four million, three hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •