Base | Representation |
---|---|
bin | 1000001110001000000… |
… | …1100100001000000101 |
3 | 111111112122001220001022 |
4 | 2003202001210020011 |
5 | 4303220114430110 |
6 | 144514114440525 |
7 | 13126556546405 |
oct | 2034201441005 |
9 | 444478056038 |
10 | 141231014405 |
11 | 54994253518 |
12 | 23455b93145 |
13 | 104199250a0 |
14 | 6b9ad12805 |
15 | 3a18d36755 |
hex | 20e2064205 |
141231014405 has 8 divisors (see below), whose sum is σ = 182513926392. Its totient is φ = 104293672128.
The previous prime is 141231014387. The next prime is 141231014467. The reversal of 141231014405 is 504410132141.
It can be written as a sum of positive squares in 4 ways, for example, as 12756798916 + 128474215489 = 112946^2 + 358433^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 141231014405 - 210 = 141231013381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1086392354 + ... + 1086392483.
It is an arithmetic number, because the mean of its divisors is an integer number (22814240799).
Almost surely, 2141231014405 is an apocalyptic number.
It is an amenable number.
141231014405 is a deficient number, since it is larger than the sum of its proper divisors (41282911987).
141231014405 is a wasteful number, since it uses less digits than its factorization.
141231014405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2172784855.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 141231014405 its reverse (504410132141), we get a palindrome (645641146546).
The spelling of 141231014405 in words is "one hundred forty-one billion, two hundred thirty-one million, fourteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •