Base | Representation |
---|---|
bin | 101000001111001… |
… | …1000110011111111 |
3 | 10111002112101022212 |
4 | 1100132120303333 |
5 | 10231114040411 |
6 | 341550131035 |
7 | 45313012433 |
oct | 12036306377 |
9 | 3432471285 |
10 | 1350143231 |
11 | 633136658 |
12 | 3181b0a7b |
13 | 186943628 |
14 | cb4549c3 |
15 | 7d7e768b |
hex | 50798cff |
1350143231 has 2 divisors, whose sum is σ = 1350143232. Its totient is φ = 1350143230.
The previous prime is 1350143191. The next prime is 1350143237. The reversal of 1350143231 is 1323410531.
It is a strong prime.
It is an emirp because it is prime and its reverse (1323410531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1350143231 - 26 = 1350143167 is a prime.
It is a super-3 number, since 3×13501432313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1350143197 and 1350143206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350143237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675071615 + 675071616.
It is an arithmetic number, because the mean of its divisors is an integer number (675071616).
Almost surely, 21350143231 is an apocalyptic number.
1350143231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350143231 is an equidigital number, since it uses as much as digits as its factorization.
1350143231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1350143231 is about 36744.2952170810. The cubic root of 1350143231 is about 1105.2485346925.
Adding to 1350143231 its reverse (1323410531), we get a palindrome (2673553762).
The spelling of 1350143231 in words is "one billion, three hundred fifty million, one hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •