Base | Representation |
---|---|
bin | 100000010001101001011010… |
… | …111111000101010111001101 |
3 | 200121121022021012100201010211 |
4 | 200101221122333011113031 |
5 | 122101203000034304102 |
6 | 1221523004123202421 |
7 | 41620364114402023 |
oct | 4021513277052715 |
9 | 617538235321124 |
10 | 141950195619277 |
11 | 4125881587a701 |
12 | 13b06a95376411 |
13 | 6128acc8b73b6 |
14 | 270a5d740c713 |
15 | 11626b4db57d7 |
hex | 811a5afc55cd |
141950195619277 has 2 divisors, whose sum is σ = 141950195619278. Its totient is φ = 141950195619276.
The previous prime is 141950195619157. The next prime is 141950195619373. The reversal of 141950195619277 is 772916591059141.
141950195619277 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80102965400676 + 61847230218601 = 8950026^2 + 7864301^2 .
It is a cyclic number.
It is not a de Polignac number, because 141950195619277 - 235 = 141915835880909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141950195619877) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70975097809638 + 70975097809639.
It is an arithmetic number, because the mean of its divisors is an integer number (70975097809639).
Almost surely, 2141950195619277 is an apocalyptic number.
It is an amenable number.
141950195619277 is a deficient number, since it is larger than the sum of its proper divisors (1).
141950195619277 is an equidigital number, since it uses as much as digits as its factorization.
141950195619277 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42865200, while the sum is 67.
The spelling of 141950195619277 in words is "one hundred forty-one trillion, nine hundred fifty billion, one hundred ninety-five million, six hundred nineteen thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •