Base | Representation |
---|---|
bin | 11110110000011… |
… | …011000010011101 |
3 | 1022221222000211201 |
4 | 132300123002131 |
5 | 2024044311031 |
6 | 123111515501 |
7 | 15534004513 |
oct | 3660330235 |
9 | 1287860751 |
10 | 516010141 |
11 | 245302069 |
12 | 124988b91 |
13 | 82b9c45a |
14 | 4c7624b3 |
15 | 3047bd61 |
hex | 1ec1b09d |
516010141 has 2 divisors, whose sum is σ = 516010142. Its totient is φ = 516010140.
The previous prime is 516010123. The next prime is 516010147. The reversal of 516010141 is 141010615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 337787641 + 178222500 = 18379^2 + 13350^2 .
It is a cyclic number.
It is not a de Polignac number, because 516010141 - 27 = 516010013 is a prime.
It is a super-2 number, since 2×5160101412 = 532532931229679762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (516010147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 258005070 + 258005071.
It is an arithmetic number, because the mean of its divisors is an integer number (258005071).
Almost surely, 2516010141 is an apocalyptic number.
It is an amenable number.
516010141 is a deficient number, since it is larger than the sum of its proper divisors (1).
516010141 is an equidigital number, since it uses as much as digits as its factorization.
516010141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 516010141 is about 22715.8565984204. The cubic root of 516010141 is about 802.0831858167.
Adding to 516010141 its reverse (141010615), we get a palindrome (657020756).
The spelling of 516010141 in words is "five hundred sixteen million, ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •