Base | Representation |
---|---|
bin | 101010010100110101001… |
… | …011000010110101000101 |
3 | 101022001120021201102112220 |
4 | 222110311023002311011 |
5 | 340123240221301023 |
6 | 10104104021402553 |
7 | 420065306061444 |
oct | 52246513026505 |
9 | 11261507642486 |
10 | 2908584947013 |
11 | a21584415409 |
12 | 3ab853269459 |
13 | 1813807bb685 |
14 | a0ac20c8d5b |
15 | 509d404c3e3 |
hex | 2a5352c2d45 |
2908584947013 has 8 divisors (see below), whose sum is σ = 3878719527648. Its totient is φ = 1938753498864.
The previous prime is 2908584946933. The next prime is 2908584947089. The reversal of 2908584947013 is 3107494858092.
2908584947013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2908584947013 - 230 = 2907511205189 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2908584947113) 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, 75760731 + ... + 75799112.
It is an arithmetic number, because the mean of its divisors is an integer number (484839940956).
Almost surely, 22908584947013 is an apocalyptic number.
It is an amenable number.
2908584947013 is a deficient number, since it is larger than the sum of its proper divisors (970134580635).
2908584947013 is a wasteful number, since it uses less digits than its factorization.
2908584947013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151566243.
The product of its (nonzero) digits is 17418240, while the sum is 60.
The spelling of 2908584947013 in words is "two trillion, nine hundred eight billion, five hundred eighty-four million, nine hundred forty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •