Base | Representation |
---|---|
bin | 100011100101010001101… |
… | …1001111100011100101101 |
3 | 122022112000101020020222211 |
4 | 1013022203121330130231 |
5 | 1120111032023122003 |
6 | 14222343022010421 |
7 | 1013215011266521 |
oct | 107124331743455 |
9 | 18275011206884 |
10 | 4890414270253 |
11 | 16160163a9866 |
12 | 66b965a16a11 |
13 | 2962196640b5 |
14 | 12c9a95ddd81 |
15 | 87326baa96d |
hex | 472a367c72d |
4890414270253 has 2 divisors, whose sum is σ = 4890414270254. Its totient is φ = 4890414270252.
The previous prime is 4890414270241. The next prime is 4890414270263. The reversal of 4890414270253 is 3520724140984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3478530866724 + 1411883403529 = 1865082^2 + 1188227^2 .
It is a cyclic number.
It is not a de Polignac number, because 4890414270253 - 237 = 4752975316781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4890414270197 and 4890414270206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4890414270263) 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, 2445207135126 + 2445207135127.
It is an arithmetic number, because the mean of its divisors is an integer number (2445207135127).
Almost surely, 24890414270253 is an apocalyptic number.
It is an amenable number.
4890414270253 is a deficient number, since it is larger than the sum of its proper divisors (1).
4890414270253 is an equidigital number, since it uses as much as digits as its factorization.
4890414270253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 49.
The spelling of 4890414270253 in words is "four trillion, eight hundred ninety billion, four hundred fourteen million, two hundred seventy thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •