Base | Representation |
---|---|
bin | 1010111011100001… |
… | …0101000110110101 |
3 | 21120110211202020111 |
4 | 2232320111012311 |
5 | 22002101031401 |
6 | 1203045503021 |
7 | 132464414662 |
oct | 25670250665 |
9 | 7513752214 |
10 | 2934002101 |
11 | 1276193228 |
12 | 69a711a71 |
13 | 379b17524 |
14 | 1db946a69 |
15 | 1228a8e51 |
hex | aee151b5 |
2934002101 has 4 divisors (see below), whose sum is σ = 3002234752. Its totient is φ = 2865769452.
The previous prime is 2934002077. The next prime is 2934002147. The reversal of 2934002101 is 1012004392.
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 2934002101 - 29 = 2934001589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2934012101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34116261 + ... + 34116346.
It is an arithmetic number, because the mean of its divisors is an integer number (750558688).
Almost surely, 22934002101 is an apocalyptic number.
It is an amenable number.
2934002101 is a deficient number, since it is larger than the sum of its proper divisors (68232651).
2934002101 is an equidigital number, since it uses as much as digits as its factorization.
2934002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68232650.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 2934002101 is about 54166.4296497379. The cubic root of 2934002101 is about 1431.5948920978.
Adding to 2934002101 its reverse (1012004392), we get a palindrome (3946006493).
The spelling of 2934002101 in words is "two billion, nine hundred thirty-four million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •