Base | Representation |
---|---|
bin | 111101000011010010110111… |
… | …1101111010101010111111001 |
3 | 2121102102002100021022021220000 |
4 | 1322012211233233111113321 |
5 | 1030341421214233200212 |
6 | 5142045022013223213 |
7 | 221054006303025303 |
oct | 17206455757252771 |
9 | 2542362307267800 |
10 | 537014520600057 |
11 | 146122640a36985 |
12 | 50291018491b09 |
13 | 1a085337855aa6 |
14 | 96878da310973 |
15 | 4213ea7a911dc |
hex | 1e8696fbd55f9 |
537014520600057 has 40 divisors (see below), whose sum is σ = 819282806724096. Its totient is φ = 350389160468928.
The previous prime is 537014520600011. The next prime is 537014520600079. The reversal of 537014520600057 is 750006025410735.
It is a happy number.
537014520600057 is a `hidden beast` number, since 5 + 3 + 7 + 0 + 14 + 5 + 20 + 600 + 0 + 5 + 7 = 666.
It is not a de Polignac number, because 537014520600057 - 243 = 528218427577849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 537014520599985 and 537014520600021.
It is not an unprimeable number, because it can be changed into a prime (537014520600097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 443622973 + ... + 444831845.
Almost surely, 2537014520600057 is an apocalyptic number.
It is an amenable number.
537014520600057 is a deficient number, since it is larger than the sum of its proper divisors (282268286124039).
537014520600057 is a wasteful number, since it uses less digits than its factorization.
537014520600057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1325619 (or 1325610 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The spelling of 537014520600057 in words is "five hundred thirty-seven trillion, fourteen billion, five hundred twenty million, six hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •