Base | Representation |
---|---|
bin | 101001110010100… |
… | …0010111011001001 |
3 | 10121201112011112201 |
4 | 1103211002323021 |
5 | 10332432021413 |
6 | 351050240201 |
7 | 46514450431 |
oct | 12345027311 |
9 | 3551464481 |
10 | 1402220233 |
11 | 65a5758a7 |
12 | 331726061 |
13 | 19467821b |
14 | d432d2c1 |
15 | 831829dd |
hex | 53942ec9 |
1402220233 has 2 divisors, whose sum is σ = 1402220234. Its totient is φ = 1402220232.
The previous prime is 1402220221. The next prime is 1402220243. The reversal of 1402220233 is 3320222041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1194946624 + 207273609 = 34568^2 + 14397^2 .
It is an emirp because it is prime and its reverse (3320222041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1402220233 - 213 = 1402212041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1402220233.
It is not a weakly prime, because it can be changed into another prime (1402220243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 701110116 + 701110117.
It is an arithmetic number, because the mean of its divisors is an integer number (701110117).
Almost surely, 21402220233 is an apocalyptic number.
It is an amenable number.
1402220233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402220233 is an equidigital number, since it uses as much as digits as its factorization.
1402220233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 1402220233 is about 37446.2312255853. The cubic root of 1402220233 is about 1119.2799988158.
Adding to 1402220233 its reverse (3320222041), we get a palindrome (4722442274).
The spelling of 1402220233 in words is "one billion, four hundred two million, two hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •