Base | Representation |
---|---|
bin | 111101011100001010101… |
… | …100100101100010111101 |
3 | 112221122001122211100012012 |
4 | 331130022230211202331 |
5 | 1023133411332443003 |
6 | 12551342032221005 |
7 | 614016242336612 |
oct | 75341254454275 |
9 | 15848048740165 |
10 | 4222132312253 |
11 | 138866168a619 |
12 | 58233b69a765 |
13 | 2481b74b495b |
14 | 1084d09a4509 |
15 | 74c624968d8 |
hex | 3d70ab258bd |
4222132312253 has 2 divisors, whose sum is σ = 4222132312254. Its totient is φ = 4222132312252.
The previous prime is 4222132312193. The next prime is 4222132312303. The reversal of 4222132312253 is 3522132312224.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3738604001209 + 483528311044 = 1933547^2 + 695362^2 .
It is a cyclic number.
It is not a de Polignac number, because 4222132312253 - 28 = 4222132311997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4222132317253) 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, 2111066156126 + 2111066156127.
It is an arithmetic number, because the mean of its divisors is an integer number (2111066156127).
Almost surely, 24222132312253 is an apocalyptic number.
It is an amenable number.
4222132312253 is a deficient number, since it is larger than the sum of its proper divisors (1).
4222132312253 is an equidigital number, since it uses as much as digits as its factorization.
4222132312253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 32.
Adding to 4222132312253 its reverse (3522132312224), we get a palindrome (7744264624477).
The spelling of 4222132312253 in words is "four trillion, two hundred twenty-two billion, one hundred thirty-two million, three hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •