Base | Representation |
---|---|
bin | 101000001111000… |
… | …0000101001001001 |
3 | 10111002100100112021 |
4 | 1100132000221021 |
5 | 10231102403413 |
6 | 341544044441 |
7 | 45312121006 |
oct | 12036005111 |
9 | 3432310467 |
10 | 1350044233 |
11 | 63307923a |
12 | 318163721 |
13 | 18690a555 |
14 | cb42a8ad |
15 | 7d7c818d |
hex | 50780a49 |
1350044233 has 2 divisors, whose sum is σ = 1350044234. Its totient is φ = 1350044232.
The previous prime is 1350044209. The next prime is 1350044251. The reversal of 1350044233 is 3324400531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1196606464 + 153437769 = 34592^2 + 12387^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1350044233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1350044198 and 1350044207.
It is not a weakly prime, because it can be changed into another prime (1350044263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675022116 + 675022117.
It is an arithmetic number, because the mean of its divisors is an integer number (675022117).
Almost surely, 21350044233 is an apocalyptic number.
It is an amenable number.
1350044233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350044233 is an equidigital number, since it uses as much as digits as its factorization.
1350044233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 25.
The square root of 1350044233 is about 36742.9480717049. The cubic root of 1350044233 is about 1105.2215202577.
Adding to 1350044233 its reverse (3324400531), we get a palindrome (4674444764).
The spelling of 1350044233 in words is "one billion, three hundred fifty million, forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •