Base | Representation |
---|---|
bin | 101100011100101001000… |
… | …010100001000011110100 |
3 | 101210222222002210112021212 |
4 | 230130221002201003310 |
5 | 400020413012214022 |
6 | 10255102100300552 |
7 | 433450063642460 |
oct | 54345102410364 |
9 | 11728862715255 |
10 | 3054410273012 |
11 | a78405a7515a |
12 | 413b6b9a1758 |
13 | 1920501bb817 |
14 | a7b972574a0 |
15 | 546bb3a13e2 |
hex | 2c7290a10f4 |
3054410273012 has 12 divisors (see below), whose sum is σ = 6108820546080. Its totient is φ = 1309032974136.
The previous prime is 3054410273011. The next prime is 3054410273023. The reversal of 3054410273012 is 2103720144503.
3054410273012 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 3054410273012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3054410273011) 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, 54543040562 + ... + 54543040617.
It is an arithmetic number, because the mean of its divisors is an integer number (509068378840).
Almost surely, 23054410273012 is an apocalyptic number.
It is an amenable number.
3054410273012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3054410273012 is a wasteful number, since it uses less digits than its factorization.
3054410273012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109086081190 (or 109086081188 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 3054410273012 in words is "three trillion, fifty-four billion, four hundred ten million, two hundred seventy-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •