Base | Representation |
---|---|
bin | 1000001110110000000… |
… | …0101101000010000011 |
3 | 111111222022100010122000 |
4 | 2003230000231002003 |
5 | 4304041012422044 |
6 | 144542501515043 |
7 | 13133662636221 |
oct | 2035400550203 |
9 | 444868303560 |
10 | 141398560899 |
11 | 54a6a88a6a2 |
12 | 234a2112a83 |
13 | 1044555871b |
14 | 6bb5287b11 |
15 | 3a288ced69 |
hex | 20ec02d083 |
141398560899 has 64 divisors (see below), whose sum is σ = 226795430400. Its totient is φ = 86763643776.
The previous prime is 141398560883. The next prime is 141398560903. The reversal of 141398560899 is 998065893141.
141398560899 is a `hidden beast` number, since 1 + 4 + 13 + 9 + 8 + 5 + 608 + 9 + 9 = 666.
It is a Cunningham number, because it is equal to 3760302-1.
It is not a de Polignac number, because 141398560899 - 24 = 141398560883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141398560829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13907992 + ... + 13918154.
It is an arithmetic number, because the mean of its divisors is an integer number (3543678600).
Almost surely, 2141398560899 is an apocalyptic number.
141398560899 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
141398560899 is a deficient number, since it is larger than the sum of its proper divisors (85396869501).
141398560899 is a wasteful number, since it uses less digits than its factorization.
141398560899 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10961 (or 10955 counting only the distinct ones).
The product of its (nonzero) digits is 16796160, while the sum is 63.
The spelling of 141398560899 in words is "one hundred forty-one billion, three hundred ninety-eight million, five hundred sixty thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •