Base | Representation |
---|---|
bin | 1111110101111001001… |
… | …10010010100100000001 |
3 | 1221001000021222201220202 |
4 | 13322330212102210001 |
5 | 32404241442032114 |
6 | 1054021201414545 |
7 | 54220001641301 |
oct | 7727446224401 |
9 | 1831007881822 |
10 | 544330033409 |
11 | 19a938127748 |
12 | 895b303a455 |
13 | 3c43a306a86 |
14 | 1c4ba8d5601 |
15 | e25c832cde |
hex | 7ebc992901 |
544330033409 has 2 divisors, whose sum is σ = 544330033410. Its totient is φ = 544330033408.
The previous prime is 544330033297. The next prime is 544330033411. The reversal of 544330033409 is 904330033445.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 512849338225 + 31480695184 = 716135^2 + 177428^2 .
It is a cyclic number.
It is not a de Polignac number, because 544330033409 - 28 = 544330033153 is a prime.
It is a super-2 number, since 2×5443300334092 (a number of 24 digits) contains 22 as substring.
Together with 544330033411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (544330033909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 272165016704 + 272165016705.
It is an arithmetic number, because the mean of its divisors is an integer number (272165016705).
Almost surely, 2544330033409 is an apocalyptic number.
It is an amenable number.
544330033409 is a deficient number, since it is larger than the sum of its proper divisors (1).
544330033409 is an equidigital number, since it uses as much as digits as its factorization.
544330033409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 38.
The spelling of 544330033409 in words is "five hundred forty-four billion, three hundred thirty million, thirty-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •