Base | Representation |
---|---|
bin | 1011011000010100… |
… | …0001110100010001 |
3 | 21212220002110200012 |
4 | 2312011001310101 |
5 | 22224010141343 |
6 | 1223042204305 |
7 | 135462062165 |
oct | 26605016421 |
9 | 7786073605 |
10 | 3054771473 |
11 | 1328380026 |
12 | 713053695 |
13 | 398b506b0 |
14 | 20d9c2ca5 |
15 | 12d2b2718 |
hex | b6141d11 |
3054771473 has 16 divisors (see below), whose sum is σ = 3438341760. Its totient is φ = 2692825344.
The previous prime is 3054771409. The next prime is 3054771479. The reversal of 3054771473 is 3741774503.
It is a cyclic number.
It is not a de Polignac number, because 3054771473 - 26 = 3054771409 is a prime.
It is a super-5 number, since 5×30547714735 (a number of 49 digits) contains 55555 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3054771473.
It is not an unprimeable number, because it can be changed into a prime (3054771479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184313 + ... + 200201.
It is an arithmetic number, because the mean of its divisors is an integer number (214896360).
Almost surely, 23054771473 is an apocalyptic number.
It is an amenable number.
3054771473 is a deficient number, since it is larger than the sum of its proper divisors (383570287).
3054771473 is a wasteful number, since it uses less digits than its factorization.
3054771473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16568.
The product of its (nonzero) digits is 246960, while the sum is 41.
The square root of 3054771473 is about 55269.9870906444. The cubic root of 3054771473 is about 1450.9738163919.
The spelling of 3054771473 in words is "three billion, fifty-four million, seven hundred seventy-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •