Base | Representation |
---|---|
bin | 101011001111110… |
… | …1001111111000001 |
3 | 10202010120111111020 |
4 | 1112133221333001 |
5 | 10432442422014 |
6 | 355554540053 |
7 | 50650322655 |
oct | 12637517701 |
9 | 3663514436 |
10 | 1451139009 |
11 | 685148241 |
12 | 345b97629 |
13 | 1a1845448 |
14 | daa24a65 |
15 | 875e71a9 |
hex | 567e9fc1 |
1451139009 has 4 divisors (see below), whose sum is σ = 1934852016. Its totient is φ = 967426004.
The previous prime is 1451138999. The next prime is 1451139073. The reversal of 1451139009 is 9009311541.
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 1451139009 - 28 = 1451138753 is a prime.
It is a super-3 number, since 3×14511390093 (a number of 28 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1451135009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 241856499 + ... + 241856504.
It is an arithmetic number, because the mean of its divisors is an integer number (483713004).
Almost surely, 21451139009 is an apocalyptic number.
It is an amenable number.
1451139009 is a deficient number, since it is larger than the sum of its proper divisors (483713007).
1451139009 is an equidigital number, since it uses as much as digits as its factorization.
1451139009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483713006.
The product of its (nonzero) digits is 4860, while the sum is 33.
The square root of 1451139009 is about 38093.8185142944. The cubic root of 1451139009 is about 1132.1474836143.
The spelling of 1451139009 in words is "one billion, four hundred fifty-one million, one hundred thirty-nine thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •