Base | Representation |
---|---|
bin | 1000001110111100000… |
… | …1111001000010010101 |
3 | 111112002211122001201021 |
4 | 2003233001321002111 |
5 | 4304141444010421 |
6 | 144551511201141 |
7 | 13135146252310 |
oct | 2035701710225 |
9 | 445084561637 |
10 | 141449203861 |
11 | 54a9642a489 |
12 | 234b70761b1 |
13 | 10452baa684 |
14 | 6bbbcab977 |
15 | 3a2d085341 |
hex | 20ef079095 |
141449203861 has 4 divisors (see below), whose sum is σ = 161656232992. Its totient is φ = 121242174732.
The previous prime is 141449203843. The next prime is 141449203933. The reversal of 141449203861 is 168302944141.
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, and also an emirpimes, since its reverse is a distinct semiprime: 168302944141 = 239 ⋅704196419.
It is not a de Polignac number, because 141449203861 - 211 = 141449201813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141449203361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10103514555 + ... + 10103514568.
It is an arithmetic number, because the mean of its divisors is an integer number (40414058248).
Almost surely, 2141449203861 is an apocalyptic number.
It is an amenable number.
141449203861 is a deficient number, since it is larger than the sum of its proper divisors (20207029131).
141449203861 is an equidigital number, since it uses as much as digits as its factorization.
141449203861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20207029130.
The product of its (nonzero) digits is 165888, while the sum is 43.
The spelling of 141449203861 in words is "one hundred forty-one billion, four hundred forty-nine million, two hundred three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •