Base | Representation |
---|---|
bin | 100000111001110100000… |
… | …1100010101010010101011 |
3 | 121000022120222021022012121 |
4 | 1001303220030111102223 |
5 | 1043042431443024233 |
6 | 13341245344452111 |
7 | 644501234324335 |
oct | 101635014252253 |
9 | 17008528238177 |
10 | 4522201142443 |
11 | 1493944718a76 |
12 | 61052401a037 |
13 | 26a59866278a |
14 | 118c38d02455 |
15 | 7c975bee92d |
hex | 41ce83154ab |
4522201142443 has 2 divisors, whose sum is σ = 4522201142444. Its totient is φ = 4522201142442.
The previous prime is 4522201142429. The next prime is 4522201142461. The reversal of 4522201142443 is 3442411022254.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4522201142443 - 225 = 4522167588011 is a prime.
It is a super-3 number, since 3×45222011424433 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4522201142399 and 4522201142408.
It is not a weakly prime, because it can be changed into another prime (4522201142243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2261100571221 + 2261100571222.
It is an arithmetic number, because the mean of its divisors is an integer number (2261100571222).
Almost surely, 24522201142443 is an apocalyptic number.
4522201142443 is a deficient number, since it is larger than the sum of its proper divisors (1).
4522201142443 is an equidigital number, since it uses as much as digits as its factorization.
4522201142443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61440, while the sum is 34.
Adding to 4522201142443 its reverse (3442411022254), we get a palindrome (7964612164697).
The spelling of 4522201142443 in words is "four trillion, five hundred twenty-two billion, two hundred one million, one hundred forty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •