Base | Representation |
---|---|
bin | 101011000100010… |
… | …0110110011000001 |
3 | 10201201012111220211 |
4 | 1112020212303001 |
5 | 10424421043031 |
6 | 355221234121 |
7 | 50545055512 |
oct | 12610466301 |
9 | 3651174824 |
10 | 1445096641 |
11 | 6817a054a |
12 | 343b62941 |
13 | 1a050b091 |
14 | d9cd0a09 |
15 | 86d01bb1 |
hex | 56226cc1 |
1445096641 has 4 divisors (see below), whose sum is σ = 1452662784. Its totient is φ = 1437530500.
The previous prime is 1445096581. The next prime is 1445096659. The reversal of 1445096641 is 1466905441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1445096641 - 217 = 1444965569 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1445096594 and 1445096603.
It is not an unprimeable number, because it can be changed into a prime (1445096671) 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 in 3 ways as a sum of consecutive naturals, for example, 3782785 + ... + 3783166.
It is an arithmetic number, because the mean of its divisors is an integer number (363165696).
Almost surely, 21445096641 is an apocalyptic number.
It is an amenable number.
1445096641 is a deficient number, since it is larger than the sum of its proper divisors (7566143).
1445096641 is an equidigital number, since it uses as much as digits as its factorization.
1445096641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7566142.
The product of its (nonzero) digits is 103680, while the sum is 40.
The square root of 1445096641 is about 38014.4267482754. The cubic root of 1445096641 is about 1130.5739223091.
The spelling of 1445096641 in words is "one billion, four hundred forty-five million, ninety-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •