Base | Representation |
---|---|
bin | 1100101111100111111011… |
… | …0101010000100111001001 |
3 | 1211121120020001122020120121 |
4 | 3023321332311100213021 |
5 | 3314034203132213231 |
6 | 45445100015023241 |
7 | 2644233064044265 |
oct | 313717665204711 |
9 | 54546201566517 |
10 | 14012311210441 |
11 | 4512651418275 |
12 | 16a381a80ab21 |
13 | 7a848071005b |
14 | 3662b153b0a5 |
15 | 19475bb44311 |
hex | cbe7ed509c9 |
14012311210441 has 8 divisors (see below), whose sum is σ = 14028845006120. Its totient is φ = 13995780784128.
The previous prime is 14012311210409. The next prime is 14012311210453. The reversal of 14012311210441 is 14401211321041.
It can be written as a sum of positive squares in 4 ways, for example, as 69592550416 + 13942718660025 = 263804^2 + 3733995^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 14012311210441 - 25 = 14012311210409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14012311213441) 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, 7529065 + ... + 9203881.
It is an arithmetic number, because the mean of its divisors is an integer number (1753605625765).
Almost surely, 214012311210441 is an apocalyptic number.
It is an amenable number.
14012311210441 is a deficient number, since it is larger than the sum of its proper divisors (16533795679).
14012311210441 is an equidigital number, since it uses as much as digits as its factorization.
14012311210441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684683.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 14012311210441 its reverse (14401211321041), we get a palindrome (28413522531482).
The spelling of 14012311210441 in words is "fourteen trillion, twelve billion, three hundred eleven million, two hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •