Base | Representation |
---|---|
bin | 101011000100010… |
… | …0101010101010001 |
3 | 10201201012012200121 |
4 | 1112020211111101 |
5 | 10424420400031 |
6 | 355221150241 |
7 | 50545032151 |
oct | 12610452521 |
9 | 3651165617 |
10 | 1445090641 |
11 | 681796a95 |
12 | 343b5b381 |
13 | 1a0508427 |
14 | d9ccc761 |
15 | 86d00011 |
hex | 56225551 |
1445090641 has 2 divisors, whose sum is σ = 1445090642. Its totient is φ = 1445090640.
The previous prime is 1445090629. The next prime is 1445090741. The reversal of 1445090641 is 1460905441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 858724416 + 586366225 = 29304^2 + 24215^2 .
It is an emirp because it is prime and its reverse (1460905441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1445090641 - 25 = 1445090609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1445090597 and 1445090606.
It is not a weakly prime, because it can be changed into another prime (1445090741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 722545320 + 722545321.
It is an arithmetic number, because the mean of its divisors is an integer number (722545321).
Almost surely, 21445090641 is an apocalyptic number.
It is an amenable number.
1445090641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1445090641 is an equidigital number, since it uses as much as digits as its factorization.
1445090641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 1445090641 is about 38014.3478307862. The cubic root of 1445090641 is about 1130.5723576034.
The spelling of 1445090641 in words is "one billion, four hundred forty-five million, ninety thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •