Base | Representation |
---|---|
bin | 1111101100100010… |
… | …1010001101010101 |
3 | 101212122011102100102 |
4 | 3323020222031111 |
5 | 32112104220003 |
6 | 1534030423445 |
7 | 206260615616 |
oct | 37310521525 |
9 | 11778142312 |
10 | 4213351253 |
11 | 1872366181 |
12 | 997061b85 |
13 | 521ba1a67 |
14 | 2bd80dc0d |
15 | 199d6a588 |
hex | fb22a355 |
4213351253 has 2 divisors, whose sum is σ = 4213351254. Its totient is φ = 4213351252.
The previous prime is 4213351201. The next prime is 4213351271. The reversal of 4213351253 is 3521533124.
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., 2865139729 + 1348211524 = 53527^2 + 36718^2 .
It is a cyclic number.
It is not a de Polignac number, because 4213351253 - 26 = 4213351189 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4213351273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2106675626 + 2106675627.
It is an arithmetic number, because the mean of its divisors is an integer number (2106675627).
Almost surely, 24213351253 is an apocalyptic number.
It is an amenable number.
4213351253 is a deficient number, since it is larger than the sum of its proper divisors (1).
4213351253 is an equidigital number, since it uses as much as digits as its factorization.
4213351253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 29.
The square root of 4213351253 is about 64910.3324055577. The cubic root of 4213351253 is about 1615.1364641690.
Adding to 4213351253 its reverse (3521533124), we get a palindrome (7734884377).
The spelling of 4213351253 in words is "four billion, two hundred thirteen million, three hundred fifty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •