Base | Representation |
---|---|
bin | 100010111011010101011… |
… | …1101011111010000000101 |
3 | 121222220112102020101200022 |
4 | 1011312222331133100011 |
5 | 1112122102224341031 |
6 | 14113125425424525 |
7 | 1003546031561345 |
oct | 105665275372005 |
9 | 17886472211608 |
10 | 4800346715141 |
11 | 15908a76375aa |
12 | 65640a49b145 |
13 | 28a89484b0a3 |
14 | 1284a3758d25 |
15 | 84d0493797b |
hex | 45daaf5f405 |
4800346715141 has 2 divisors, whose sum is σ = 4800346715142. Its totient is φ = 4800346715140.
The previous prime is 4800346715123. The next prime is 4800346715201. The reversal of 4800346715141 is 1415176430084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3125770960225 + 1674575754916 = 1767985^2 + 1294054^2 .
It is a cyclic number.
It is not a de Polignac number, because 4800346715141 - 234 = 4783166845957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4800346715092 and 4800346715101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4800346715441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2400173357570 + 2400173357571.
It is an arithmetic number, because the mean of its divisors is an integer number (2400173357571).
Almost surely, 24800346715141 is an apocalyptic number.
It is an amenable number.
4800346715141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4800346715141 is an equidigital number, since it uses as much as digits as its factorization.
4800346715141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 322560, while the sum is 44.
The spelling of 4800346715141 in words is "four trillion, eight hundred billion, three hundred forty-six million, seven hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •