Base | Representation |
---|---|
bin | 101100011000000110011… |
… | …100010010111111011100 |
3 | 101210112101022211221200211 |
4 | 230120012130102333130 |
5 | 344430421411030101 |
6 | 10252534215302204 |
7 | 433215213426211 |
oct | 54300634227734 |
9 | 11715338757624 |
10 | 3049534861276 |
11 | a76333a23162 |
12 | 41302b07a964 |
13 | 1917541023c7 |
14 | a7853947b08 |
15 | 544d3359c51 |
hex | 2c606712fdc |
3049534861276 has 24 divisors (see below), whose sum is σ = 5619476016000. Its totient is φ = 1444024908144.
The previous prime is 3049534861253. The next prime is 3049534861279. The reversal of 3049534861276 is 6721684359403.
3049534861276 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 3049534861276.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3049534861279) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6603016 + ... + 7049743.
It is an arithmetic number, because the mean of its divisors is an integer number (234144834000).
It is a 1-persistent number, because it is pandigital, but 2⋅3049534861276 = 6099069722552 is not.
Almost surely, 23049534861276 is an apocalyptic number.
It is an amenable number.
3049534861276 is a deficient number, since it is larger than the sum of its proper divisors (2569941154724).
3049534861276 is a wasteful number, since it uses less digits than its factorization.
3049534861276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13655721 (or 13655719 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 58.
The spelling of 3049534861276 in words is "three trillion, forty-nine billion, five hundred thirty-four million, eight hundred sixty-one thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •