Base | Representation |
---|---|
bin | 11000101110001111101111… |
… | …01000000111111111111001 |
3 | 21010111022000001010022011110 |
4 | 30113013313220013333321 |
5 | 24111211124210300340 |
6 | 311343105203350533 |
7 | 14310532101404565 |
oct | 1427076750077771 |
9 | 233438001108143 |
10 | 54365555556345 |
11 | 163603368937a0 |
12 | 61204aa682449 |
13 | 244485aa70627 |
14 | d5d4422d86a5 |
15 | 64428d622680 |
hex | 3171f7a07ff9 |
54365555556345 has 16 divisors (see below), whose sum is σ = 94892606062272. Its totient is φ = 26359057239360.
The previous prime is 54365555556313. The next prime is 54365555556373.
54365555556345 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 54365555556345 - 25 = 54365555556313 is a prime.
It is a super-2 number, since 2×543655555563452 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164744107582 + ... + 164744107911.
It is an arithmetic number, because the mean of its divisors is an integer number (5930787878892).
Almost surely, 254365555556345 is an apocalyptic number.
54365555556345 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
54365555556345 is a deficient number, since it is larger than the sum of its proper divisors (40527050505927).
54365555556345 is a wasteful number, since it uses less digits than its factorization.
54365555556345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329488215512.
The product of its digits is 2025000000, while the sum is 66.
The spelling of 54365555556345 in words is "fifty-four trillion, three hundred sixty-five billion, five hundred fifty-five million, five hundred fifty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •