Base | Representation |
---|---|
bin | 1000010000111100110… |
… | …1011011110000001111 |
3 | 111120111110112122202021 |
4 | 2010033031123300033 |
5 | 4311243202204214 |
6 | 145121235111011 |
7 | 13154423304205 |
oct | 2041715336017 |
9 | 446443478667 |
10 | 141989100559 |
11 | 552431668a9 |
12 | 23627a42467 |
13 | 1050a9c1287 |
14 | 6c2d88b075 |
15 | 3a6067e924 |
hex | 210f35bc0f |
141989100559 has 2 divisors, whose sum is σ = 141989100560. Its totient is φ = 141989100558.
The previous prime is 141989100557. The next prime is 141989100637. The reversal of 141989100559 is 955001989141.
It is a happy number.
141989100559 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 141989100559 - 21 = 141989100557 is a prime.
It is a super-2 number, since 2×1419891005592 (a number of 23 digits) contains 22 as substring.
Together with 141989100557, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141989100557) 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, 70994550279 + 70994550280.
It is an arithmetic number, because the mean of its divisors is an integer number (70994550280).
Almost surely, 2141989100559 is an apocalyptic number.
141989100559 is a deficient number, since it is larger than the sum of its proper divisors (1).
141989100559 is an equidigital number, since it uses as much as digits as its factorization.
141989100559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 52.
The spelling of 141989100559 in words is "one hundred forty-one billion, nine hundred eighty-nine million, one hundred thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •