Base | Representation |
---|---|
bin | 100111000101010… |
… | …1011011001010001 |
3 | 10101101200010211102 |
4 | 1032022223121101 |
5 | 10141211001113 |
6 | 334044154145 |
7 | 44332621565 |
oct | 11612533121 |
9 | 3341603742 |
10 | 1311422033 |
11 | 613299869 |
12 | 307238955 |
13 | 17b906b8c |
14 | c62556a5 |
15 | 7a1e9758 |
hex | 4e2ab651 |
1311422033 has 2 divisors, whose sum is σ = 1311422034. Its totient is φ = 1311422032.
The previous prime is 1311422029. The next prime is 1311422053. The reversal of 1311422033 is 3302241131.
It is an a-pointer prime, because the next prime (1311422053) can be obtained adding 1311422033 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1056445009 + 254977024 = 32503^2 + 15968^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311422033 - 22 = 1311422029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311421996 and 1311422014.
It is not a weakly prime, because it can be changed into another prime (1311422003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655711016 + 655711017.
It is an arithmetic number, because the mean of its divisors is an integer number (655711017).
Almost surely, 21311422033 is an apocalyptic number.
It is an amenable number.
1311422033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311422033 is an equidigital number, since it uses as much as digits as its factorization.
1311422033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1311422033 is about 36213.5614514784. The cubic root of 1311422033 is about 1094.5799582953.
Adding to 1311422033 its reverse (3302241131), we get a palindrome (4613663164).
The spelling of 1311422033 in words is "one billion, three hundred eleven million, four hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •