Base | Representation |
---|---|
bin | 1010100011110110… |
… | …1001001111101101 |
3 | 21022120001022021120 |
4 | 2220331221033231 |
5 | 21301142411023 |
6 | 1145142051153 |
7 | 130150552551 |
oct | 25075511755 |
9 | 7276038246 |
10 | 2834732013 |
11 | 1225150133 |
12 | 671419ab9 |
13 | 36239b029 |
14 | 1cc6a5861 |
15 | 118cea8e3 |
hex | a8f693ed |
2834732013 has 8 divisors (see below), whose sum is σ = 3832877376. Its totient is φ = 1863204000.
The previous prime is 2834731993. The next prime is 2834732029. The reversal of 2834732013 is 3102374382.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2834732013 - 210 = 2834730989 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2834732053) 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 7 ways as a sum of consecutive naturals, for example, 6654088 + ... + 6654513.
It is an arithmetic number, because the mean of its divisors is an integer number (479109672).
Almost surely, 22834732013 is an apocalyptic number.
It is an amenable number.
2834732013 is a deficient number, since it is larger than the sum of its proper divisors (998145363).
2834732013 is a wasteful number, since it uses less digits than its factorization.
2834732013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13308675.
The product of its (nonzero) digits is 24192, while the sum is 33.
The square root of 2834732013 is about 53242.2014289417. The cubic root of 2834732013 is about 1415.2635972521.
The spelling of 2834732013 in words is "two billion, eight hundred thirty-four million, seven hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •