Base | Representation |
---|---|
bin | 11111111110111001… |
… | …010101000000101001 |
3 | 10021122022001022222012 |
4 | 133332321111000221 |
5 | 1030312322242301 |
6 | 23435351205305 |
7 | 2324002326122 |
oct | 377671250051 |
9 | 107568038865 |
10 | 34341212201 |
11 | 136227a000a |
12 | 67a4976835 |
13 | 33138b3b0a |
14 | 193ac1d049 |
15 | d5ecedebb |
hex | 7fee55029 |
34341212201 has 4 divisors (see below), whose sum is σ = 34341773652. Its totient is φ = 34340650752.
The previous prime is 34341212177. The next prime is 34341212203. The reversal of 34341212201 is 10221214343.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17503554601 + 16837657600 = 132301^2 + 129760^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34341212201 is a prime.
It is a super-2 number, since 2×343412122012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34341212203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175940 + ... + 315653.
It is an arithmetic number, because the mean of its divisors is an integer number (8585443413).
Almost surely, 234341212201 is an apocalyptic number.
It is an amenable number.
34341212201 is a deficient number, since it is larger than the sum of its proper divisors (561451).
34341212201 is an equidigital number, since it uses as much as digits as its factorization.
34341212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 561450.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 34341212201 its reverse (10221214343), we get a palindrome (44562426544).
The spelling of 34341212201 in words is "thirty-four billion, three hundred forty-one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •