Base | Representation |
---|---|
bin | 11000100111100110110010… |
… | …01110000100011101111001 |
3 | 21002200111010100001002100111 |
4 | 30103303121032010131321 |
5 | 24043441410002033334 |
6 | 311050214522304321 |
7 | 14255204353365661 |
oct | 1423633116043571 |
9 | 232614110032314 |
10 | 54137412142969 |
11 | 16282602882581 |
12 | 60a42399580a1 |
13 | 242919cbcc83c |
14 | d5239c5b51a1 |
15 | 63d389559064 |
hex | 313cd9384779 |
54137412142969 has 9 divisors (see below), whose sum is σ = 54281957717509. Its totient is φ = 53993250512860.
The previous prime is 54137412142951. The next prime is 54137412142997. The reversal of 54137412142969 is 96924121473145.
The square root of 54137412142969 is 7357813.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 54137412142969 - 223 = 54137403754361 is a prime.
It is a super-2 number, since 2×541374121429692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54137412172969) 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, 2818032774 + ... + 2818051984.
Almost surely, 254137412142969 is an apocalyptic number.
54137412142969 is the 7357813-rd square number.
54137412142969 is the 3678907-th centered octagonal number.
It is an amenable number.
54137412142969 is a deficient number, since it is larger than the sum of its proper divisors (144545574540).
54137412142969 is an frugal number, since it uses more digits than its factorization.
54137412142969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39188 (or 19594 counting only the distinct ones).
The product of its digits is 13063680, while the sum is 58.
The spelling of 54137412142969 in words is "fifty-four trillion, one hundred thirty-seven billion, four hundred twelve million, one hundred forty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •