Base | Representation |
---|---|
bin | 100101000001011… |
… | …1001011010011001 |
3 | 10012120120000210011 |
4 | 1022002321122121 |
5 | 10021010222213 |
6 | 323134121521 |
7 | 42533102302 |
oct | 11202713231 |
9 | 3176500704 |
10 | 1242273433 |
11 | 58825a465 |
12 | 2a80502a1 |
13 | 16a4a5a4b |
14 | badb57a9 |
15 | 740db03d |
hex | 4a0b9699 |
1242273433 has 2 divisors, whose sum is σ = 1242273434. Its totient is φ = 1242273432.
The previous prime is 1242273343. The next prime is 1242273449. The reversal of 1242273433 is 3343722421.
Together with previous prime (1242273343) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1241646169 + 627264 = 35237^2 + 792^2 .
It is a cyclic number.
It is not a de Polignac number, because 1242273433 - 217 = 1242142361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1242273395 and 1242273404.
It is not a weakly prime, because it can be changed into another prime (1242276433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 621136716 + 621136717.
It is an arithmetic number, because the mean of its divisors is an integer number (621136717).
Almost surely, 21242273433 is an apocalyptic number.
It is an amenable number.
1242273433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1242273433 is an equidigital number, since it uses as much as digits as its factorization.
1242273433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 24192, while the sum is 31.
The square root of 1242273433 is about 35245.8995203697. The cubic root of 1242273433 is about 1074.9932382484.
Adding to 1242273433 its reverse (3343722421), we get a palindrome (4585995854).
The spelling of 1242273433 in words is "one billion, two hundred forty-two million, two hundred seventy-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •