Base | Representation |
---|---|
bin | 11110101001010… |
… | …001111010101000 |
3 | 1022211102220102120 |
4 | 132221101322220 |
5 | 2023104402033 |
6 | 123003431240 |
7 | 15512045634 |
oct | 3651217250 |
9 | 1284386376 |
10 | 514137768 |
11 | 244243351 |
12 | 124225520 |
13 | 82695141 |
14 | 4c3d5dc4 |
15 | 3020c1b3 |
hex | 1ea51ea8 |
514137768 has 64 divisors (see below), whose sum is σ = 1363305600. Its totient is φ = 161230080.
The previous prime is 514137763. The next prime is 514137797. The reversal of 514137768 is 867731415.
It is a super-4 number, since 4×5141377684 (a number of 36 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (514137763) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26038 + ... + 41306.
It is an arithmetic number, because the mean of its divisors is an integer number (21301650).
Almost surely, 2514137768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 514137768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (681652800).
514137768 is an abundant number, since it is smaller than the sum of its proper divisors (849167832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
514137768 is a wasteful number, since it uses less digits than its factorization.
514137768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15362 (or 15358 counting only the distinct ones).
The product of its digits is 141120, while the sum is 42.
The square root of 514137768 is about 22674.6062369339. The cubic root of 514137768 is about 801.1118747855. Note that the first 3 decimals are identical.
The spelling of 514137768 in words is "five hundred fourteen million, one hundred thirty-seven thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •