Base | Representation |
---|---|
bin | 10101001000000110110… |
… | …101000001100000000001 |
3 | 12010210101101020202221012 |
4 | 111020012311001200001 |
5 | 142241303224242441 |
6 | 3030542014010305 |
7 | 206614202133263 |
oct | 25100665014001 |
9 | 5123341222835 |
10 | 1451813509121 |
11 | 50a78a971608 |
12 | 1b54554a6995 |
13 | a6ba02b6801 |
14 | 503a7b2bb33 |
15 | 27b71d2a9eb |
hex | 15206d41801 |
1451813509121 has 8 divisors (see below), whose sum is σ = 1475680569000. Its totient is φ = 1427948605440.
The previous prime is 1451813509087. The next prime is 1451813509147. The reversal of 1451813509121 is 1219053181541.
It can be written as a sum of positive squares in 4 ways, for example, as 385344219121 + 1066469290000 = 620761^2 + 1032700^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1451813509121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1451813509021) 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 7 ways as a sum of consecutive naturals, for example, 847745 + ... + 1903233.
It is an arithmetic number, because the mean of its divisors is an integer number (184460071125).
Almost surely, 21451813509121 is an apocalyptic number.
It is an amenable number.
1451813509121 is a deficient number, since it is larger than the sum of its proper divisors (23867059879).
1451813509121 is a wasteful number, since it uses less digits than its factorization.
1451813509121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078099.
The product of its (nonzero) digits is 43200, while the sum is 41.
The spelling of 1451813509121 in words is "one trillion, four hundred fifty-one billion, eight hundred thirteen million, five hundred nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •