Base | Representation |
---|---|
bin | 1100111101101101111… |
… | …01010010001011101001 |
3 | 1120120210020221000120212 |
4 | 12132312331102023221 |
5 | 24244240443300212 |
6 | 540345404030505 |
7 | 44116460205404 |
oct | 6366675221351 |
9 | 1516706830525 |
10 | 445451150057 |
11 | 161a0761a131 |
12 | 723b8832435 |
13 | 3300cb5c784 |
14 | 177ba70cd3b |
15 | b8c1c50e22 |
hex | 67b6f522e9 |
445451150057 has 2 divisors, whose sum is σ = 445451150058. Its totient is φ = 445451150056.
The previous prime is 445451150033. The next prime is 445451150197. The reversal of 445451150057 is 750051154544.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 341084032576 + 104367117481 = 584024^2 + 323059^2 .
It is a cyclic number.
It is not a de Polignac number, because 445451150057 - 222 = 445446955753 is a prime.
It is a super-2 number, since 2×4454511500572 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 445451149996 and 445451150023.
It is not a weakly prime, because it can be changed into another prime (445451150257) 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, 222725575028 + 222725575029.
It is an arithmetic number, because the mean of its divisors is an integer number (222725575029).
Almost surely, 2445451150057 is an apocalyptic number.
It is an amenable number.
445451150057 is a deficient number, since it is larger than the sum of its proper divisors (1).
445451150057 is an equidigital number, since it uses as much as digits as its factorization.
445451150057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280000, while the sum is 41.
The spelling of 445451150057 in words is "four hundred forty-five billion, four hundred fifty-one million, one hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •