Base | Representation |
---|---|
bin | 11000101011001001110111… |
… | …10110110110011000101001 |
3 | 21010010010210201122000020211 |
4 | 30111210323312312120221 |
5 | 24102441044434202044 |
6 | 311222220145221121 |
7 | 14300051452655200 |
oct | 1425447366663051 |
9 | 233103721560224 |
10 | 54259326084649 |
11 | 1631a284045384 |
12 | 61039a26317a1 |
13 | 243782b78c47a |
14 | d58245bb4237 |
15 | 641622573634 |
hex | 31593bdb6629 |
54259326084649 has 9 divisors (see below), whose sum is σ = 63118051548957. Its totient is φ = 46507949590284.
The previous prime is 54259326084647. The next prime is 54259326084653. The reversal of 54259326084649 is 94648062395245.
The square root of 54259326084649 is 7366093.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 54259326084649 - 21 = 54259326084647 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54259326084641) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 51036502 + ... + 52088800.
It is an arithmetic number, because the mean of its divisors is an integer number (7013116838773).
Almost surely, 254259326084649 is an apocalyptic number.
54259326084649 is the 7366093-rd square number.
54259326084649 is the 3683047-th centered octagonal number.
It is an amenable number.
54259326084649 is a deficient number, since it is larger than the sum of its proper divisors (8858725464308).
54259326084649 is an frugal number, since it uses more digits than its factorization.
54259326084649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2104612 (or 1052306 counting only the distinct ones).
The product of its (nonzero) digits is 447897600, while the sum is 67.
The spelling of 54259326084649 in words is "fifty-four trillion, two hundred fifty-nine billion, three hundred twenty-six million, eighty-four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •