Base | Representation |
---|---|
bin | 11001111111101101… |
… | …01000111110111111 |
3 | 1100000122000220202020 |
4 | 30333312220332333 |
5 | 212040241041033 |
6 | 10224505331223 |
7 | 1002563442000 |
oct | 147766507677 |
9 | 40018026666 |
10 | 13956190143 |
11 | 5a119a6245 |
12 | 2855a96b13 |
13 | 141551019c |
14 | 9657511a7 |
15 | 56a37c6b3 |
hex | 33fda8fbf |
13956190143 has 32 divisors (see below), whose sum is σ = 21731136000. Its totient is φ = 7963740288.
The previous prime is 13956190141. The next prime is 13956190177. The reversal of 13956190143 is 34109165931.
It is not a de Polignac number, because 13956190143 - 21 = 13956190141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13956190095 and 13956190104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13956190141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 751255 + ... + 769607.
It is an arithmetic number, because the mean of its divisors is an integer number (679098000).
Almost surely, 213956190143 is an apocalyptic number.
13956190143 is a deficient number, since it is larger than the sum of its proper divisors (7774945857).
13956190143 is an equidigital number, since it uses as much as digits as its factorization.
13956190143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19116 (or 19102 counting only the distinct ones).
The product of its (nonzero) digits is 87480, while the sum is 42.
The spelling of 13956190143 in words is "thirteen billion, nine hundred fifty-six million, one hundred ninety thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •