Base | Representation |
---|---|
bin | 10100000010001011101001… |
… | …11100010001101111101011 |
3 | 12202222122210110121102000201 |
4 | 22001011310330101233223 |
5 | 21233301021011412301 |
6 | 233410442422213031 |
7 | 12164620624122244 |
oct | 1201056474215753 |
9 | 182878713542021 |
10 | 44055441513451 |
11 | 13045898236345 |
12 | 4b362a6284177 |
13 | 1b775445a9754 |
14 | ac441aad9ccb |
15 | 515eb3137201 |
hex | 281174f11beb |
44055441513451 has 2 divisors, whose sum is σ = 44055441513452. Its totient is φ = 44055441513450.
The previous prime is 44055441513409. The next prime is 44055441513487. The reversal of 44055441513451 is 15431514455044.
It is a happy number.
44055441513451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 44055441513451 - 225 = 44055407959019 is a prime.
It is not a weakly prime, because it can be changed into another prime (44055441213451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22027720756725 + 22027720756726.
It is an arithmetic number, because the mean of its divisors is an integer number (22027720756726).
Almost surely, 244055441513451 is an apocalyptic number.
44055441513451 is a deficient number, since it is larger than the sum of its proper divisors (1).
44055441513451 is an equidigital number, since it uses as much as digits as its factorization.
44055441513451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920000, while the sum is 46.
Adding to 44055441513451 its reverse (15431514455044), we get a palindrome (59486955968495).
The spelling of 44055441513451 in words is "forty-four trillion, fifty-five billion, four hundred forty-one million, five hundred thirteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •