Base | Representation |
---|---|
bin | 1000001101100100000… |
… | …0111110111101010011 |
3 | 111111011002122211002101 |
4 | 2003121000332331103 |
5 | 4302412421222334 |
6 | 144451115101231 |
7 | 13123043041144 |
oct | 2033100767523 |
9 | 444132584071 |
10 | 141079867219 |
11 | 549169a8395 |
12 | 23413441817 |
13 | 103c4513c95 |
14 | 6b84c09acb |
15 | 3a0a92c214 |
hex | 20d903ef53 |
141079867219 has 2 divisors, whose sum is σ = 141079867220. Its totient is φ = 141079867218.
The previous prime is 141079867207. The next prime is 141079867259. The reversal of 141079867219 is 912768970141.
It is a happy number.
141079867219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141079867219 - 219 = 141079342931 is a prime.
It is a super-2 number, since 2×1410798672192 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 141079867219.
It is not a weakly prime, because it can be changed into another prime (141079867259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70539933609 + 70539933610.
It is an arithmetic number, because the mean of its divisors is an integer number (70539933610).
Almost surely, 2141079867219 is an apocalyptic number.
141079867219 is a deficient number, since it is larger than the sum of its proper divisors (1).
141079867219 is an equidigital number, since it uses as much as digits as its factorization.
141079867219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1524096, while the sum is 55.
The spelling of 141079867219 in words is "one hundred forty-one billion, seventy-nine million, eight hundred sixty-seven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •