Base | Representation |
---|---|
bin | 100000000001000… |
… | …010111010110110 |
3 | 1101102201210102210 |
4 | 200001002322312 |
5 | 2100002120024 |
6 | 125144514250 |
7 | 16211441310 |
oct | 4001027266 |
9 | 1342653383 |
10 | 537145014 |
11 | 256227aaa |
12 | 12ba7b986 |
13 | 8738c2b3 |
14 | 514a47b0 |
15 | 32254129 |
hex | 20042eb6 |
537145014 has 16 divisors (see below), whose sum is σ = 1227760128. Its totient is φ = 153469992.
The previous prime is 537145009. The next prime is 537145019. The reversal of 537145014 is 410541735.
It is an interprime number because it is at equal distance from previous prime (537145009) and next prime (537145019).
It is a super-4 number, since 4×5371450144 (a number of 36 digits) contains 4444 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (537145019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6394542 + ... + 6394625.
It is an arithmetic number, because the mean of its divisors is an integer number (76735008).
Almost surely, 2537145014 is an apocalyptic number.
537145014 is an abundant number, since it is smaller than the sum of its proper divisors (690615114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
537145014 is a wasteful number, since it uses less digits than its factorization.
537145014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12789179.
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 537145014 is about 23176.3891493045. The cubic root of 537145014 is about 812.8876327562.
Adding to 537145014 its reverse (410541735), we get a palindrome (947686749).
The spelling of 537145014 in words is "five hundred thirty-seven million, one hundred forty-five thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •