Base | Representation |
---|---|
bin | 101000001111100… |
… | …0011000110010001 |
3 | 10111002212011220202 |
4 | 1100133003012101 |
5 | 10231140111213 |
6 | 341553544545 |
7 | 45314333414 |
oct | 12037030621 |
9 | 3432764822 |
10 | 1350316433 |
11 | 6332447a4 |
12 | 318275155 |
13 | 1869a440b |
14 | cb49bb7b |
15 | 7d82db58 |
hex | 507c3191 |
1350316433 has 2 divisors, whose sum is σ = 1350316434. Its totient is φ = 1350316432.
The previous prime is 1350316423. The next prime is 1350316469. The reversal of 1350316433 is 3346130531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1263304849 + 87011584 = 35543^2 + 9328^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350316433 - 210 = 1350315409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1350316396 and 1350316405.
It is not a weakly prime, because it can be changed into another prime (1350316423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675158216 + 675158217.
It is an arithmetic number, because the mean of its divisors is an integer number (675158217).
Almost surely, 21350316433 is an apocalyptic number.
It is an amenable number.
1350316433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350316433 is an equidigital number, since it uses as much as digits as its factorization.
1350316433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 29.
The square root of 1350316433 is about 36746.6519971548. The cubic root of 1350316433 is about 1105.2957946343.
Adding to 1350316433 its reverse (3346130531), we get a palindrome (4696446964).
The spelling of 1350316433 in words is "one billion, three hundred fifty million, three hundred sixteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •