Base | Representation |
---|---|
bin | 11001111010111100… |
… | …10010111110111101 |
3 | 1022220211212221212001 |
4 | 30331132102332331 |
5 | 212000030113031 |
6 | 10220521342301 |
7 | 1001600131336 |
oct | 147536227675 |
9 | 38824787761 |
10 | 13916254141 |
11 | 59a13a9789 |
12 | 2844637991 |
13 | 140a16980a |
14 | 96031728d |
15 | 566ade861 |
hex | 33d792fbd |
13916254141 has 4 divisors (see below), whose sum is σ = 13917646300. Its totient is φ = 13914861984.
The previous prime is 13916254139. The next prime is 13916254147. The reversal of 13916254141 is 14145261931.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3300042916 + 10616211225 = 57446^2 + 103035^2 .
It is a cyclic number.
It is not a de Polignac number, because 13916254141 - 21 = 13916254139 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13916254141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13916254147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 680976 + ... + 701113.
It is an arithmetic number, because the mean of its divisors is an integer number (3479411575).
Almost surely, 213916254141 is an apocalyptic number.
It is an amenable number.
13916254141 is a deficient number, since it is larger than the sum of its proper divisors (1392159).
13916254141 is a wasteful number, since it uses less digits than its factorization.
13916254141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1392158.
The product of its digits is 25920, while the sum is 37.
The spelling of 13916254141 in words is "thirteen billion, nine hundred sixteen million, two hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •