Base | Representation |
---|---|
bin | 10100111110000110100… |
… | …010000101001101001001 |
3 | 12002202122201120010200112 |
4 | 110332012202011031021 |
5 | 142102303202002241 |
6 | 3022004031244105 |
7 | 206054041313132 |
oct | 24760642051511 |
9 | 5082581503615 |
10 | 1441071125321 |
11 | 506178099673 |
12 | 1b3357979635 |
13 | a5b7a86a3a9 |
14 | 4da6915ac89 |
15 | 27743bc71eb |
hex | 14f86885349 |
1441071125321 has 8 divisors (see below), whose sum is σ = 1455184074120. Its totient is φ = 1426982038272.
The previous prime is 1441071125317. The next prime is 1441071125371. The reversal of 1441071125321 is 1235211701441.
It can be written as a sum of positive squares in 4 ways, for example, as 39736036921 + 1401335088400 = 199339^2 + 1183780^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1441071125321 - 22 = 1441071125317 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1441071125371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5844050 + ... + 6085643.
It is an arithmetic number, because the mean of its divisors is an integer number (181898009265).
Almost surely, 21441071125321 is an apocalyptic number.
It is an amenable number.
1441071125321 is a deficient number, since it is larger than the sum of its proper divisors (14112948799).
1441071125321 is a wasteful number, since it uses less digits than its factorization.
1441071125321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11930875.
The product of its (nonzero) digits is 6720, while the sum is 32.
Adding to 1441071125321 its reverse (1235211701441), we get a palindrome (2676282826762).
The spelling of 1441071125321 in words is "one trillion, four hundred forty-one billion, seventy-one million, one hundred twenty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •