Base | Representation |
---|---|
bin | 101011000100011… |
… | …0000010001100001 |
3 | 10201201021111011110 |
4 | 1112020300101201 |
5 | 10424423313312 |
6 | 355222133533 |
7 | 50545306623 |
oct | 12610602141 |
9 | 3651244143 |
10 | 1445135457 |
11 | 681817727 |
12 | 343b812a9 |
13 | 1a052294c |
14 | d9d00c13 |
15 | 86d0d43c |
hex | 56230461 |
1445135457 has 4 divisors (see below), whose sum is σ = 1926847280. Its totient is φ = 963423636.
The previous prime is 1445135411. The next prime is 1445135467. The reversal of 1445135457 is 7545315441.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7545315441 = 3 ⋅2515105147.
It is not a de Polignac number, because 1445135457 - 214 = 1445119073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1445135467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240855907 + ... + 240855912.
It is an arithmetic number, because the mean of its divisors is an integer number (481711820).
Almost surely, 21445135457 is an apocalyptic number.
It is an amenable number.
1445135457 is a deficient number, since it is larger than the sum of its proper divisors (481711823).
1445135457 is an equidigital number, since it uses as much as digits as its factorization.
1445135457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481711822.
The product of its digits is 168000, while the sum is 39.
The square root of 1445135457 is about 38014.9372878609. The cubic root of 1445135457 is about 1130.5840448073.
The spelling of 1445135457 in words is "one billion, four hundred forty-five million, one hundred thirty-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •