Base | Representation |
---|---|
bin | 11110101001101… |
… | …000011110000011 |
3 | 1022211121121011000 |
4 | 132221220132003 |
5 | 2023120331042 |
6 | 123005423043 |
7 | 15512612154 |
oct | 3651503603 |
9 | 1284547130 |
10 | 514230147 |
11 | 2442a67a2 |
12 | 12426aa83 |
13 | 826c81c2 |
14 | 4c41b92b |
15 | 3022974c |
hex | 1ea68783 |
514230147 has 8 divisors (see below), whose sum is σ = 761822480. Its totient is φ = 342820080.
The previous prime is 514230133. The next prime is 514230169. The reversal of 514230147 is 741032415.
514230147 is a `hidden beast` number, since 514 + 2 + 3 + 0 + 147 = 666.
It is not a de Polignac number, because 514230147 - 24 = 514230131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 19045561 = 514230147 / (5 + 1 + 4 + 2 + 3 + 0 + 1 + 4 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 514230147.
It is not an unprimeable number, because it can be changed into a prime (514230187) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9522754 + ... + 9522807.
It is an arithmetic number, because the mean of its divisors is an integer number (95227810).
Almost surely, 2514230147 is an apocalyptic number.
514230147 is a deficient number, since it is larger than the sum of its proper divisors (247592333).
514230147 is a wasteful number, since it uses less digits than its factorization.
514230147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19045570 (or 19045564 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 514230147 is about 22676.6432039665. The cubic root of 514230147 is about 801.1598525109.
The spelling of 514230147 in words is "five hundred fourteen million, two hundred thirty thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •