Base | Representation |
---|---|
bin | 111100101000100… |
… | …0001010111111011 |
3 | 12020210021120110212 |
4 | 1321101001113323 |
5 | 13131313131321 |
6 | 533514301335 |
7 | 101263003034 |
oct | 17121012773 |
9 | 5223246425 |
10 | 2034505211 |
11 | 954474972 |
12 | 48942784b |
13 | 265668b4b |
14 | 1542bba8b |
15 | bd92b55b |
hex | 794415fb |
2034505211 has 4 divisors (see below), whose sum is σ = 2049355752. Its totient is φ = 2019654672.
The previous prime is 2034505189. The next prime is 2034505219. The reversal of 2034505211 is 1125054302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2034505211 - 210 = 2034504187 is a prime.
It is a super-2 number, since 2×20345052112 = 8278422907172309042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2034505219) 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, 7425065 + ... + 7425338.
It is an arithmetic number, because the mean of its divisors is an integer number (512338938).
Almost surely, 22034505211 is an apocalyptic number.
2034505211 is a deficient number, since it is larger than the sum of its proper divisors (14850541).
2034505211 is a wasteful number, since it uses less digits than its factorization.
2034505211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14850540.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 2034505211 is about 45105.4898099998. The cubic root of 2034505211 is about 1267.1254162981.
Adding to 2034505211 its reverse (1125054302), we get a palindrome (3159559513).
The spelling of 2034505211 in words is "two billion, thirty-four million, five hundred five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •