Base | Representation |
---|---|
bin | 101000010110100110110… |
… | …0111110110001011010001 |
3 | 201122012110121011002011121 |
4 | 1100231031213312023101 |
5 | 1211331410344222124 |
6 | 15443502343242241 |
7 | 1111456440161200 |
oct | 120551547661321 |
9 | 21565417132147 |
10 | 5546105070289 |
11 | 18490a97a8733 |
12 | 756a57449381 |
13 | 312cc305a904 |
14 | 15260bcd7237 |
15 | 99400ccb2e4 |
hex | 50b4d9f62d1 |
5546105070289 has 27 divisors (see below), whose sum is σ = 6518057991003. Its totient is φ = 4705323966000.
The previous prime is 5546105070229. The next prime is 5546105070299. The reversal of 5546105070289 is 9820705016455.
It is a happy number.
The square root of 5546105070289 is 2355017.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5328632074689 + 217472995600 = 2308383^2 + 466340^2 .
It is a de Polignac number, because none of the positive numbers 2k-5546105070289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5546105070229) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1664995354 + ... + 1664998684.
Almost surely, 25546105070289 is an apocalyptic number.
5546105070289 is the 2355017-th square number.
5546105070289 is the 1177509-th centered octagonal number.
It is an amenable number.
5546105070289 is a deficient number, since it is larger than the sum of its proper divisors (971952920714).
5546105070289 is an frugal number, since it uses more digits than its factorization.
5546105070289 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6878 (or 3439 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 52.
The spelling of 5546105070289 in words is "five trillion, five hundred forty-six billion, one hundred five million, seventy thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •