Base | Representation |
---|---|
bin | 11001111111101110… |
… | …00010100111100101 |
3 | 1100000122020020210001 |
4 | 30333313002213211 |
5 | 212040302421031 |
6 | 10224511501301 |
7 | 1002564360055 |
oct | 147767024745 |
9 | 40018206701 |
10 | 13956295141 |
11 | 5a11a68118 |
12 | 2855b27831 |
13 | 1415548c09 |
14 | 96577b565 |
15 | 56a39d861 |
hex | 33fdc29e5 |
13956295141 has 2 divisors, whose sum is σ = 13956295142. Its totient is φ = 13956295140.
The previous prime is 13956295069. The next prime is 13956295151. The reversal of 13956295141 is 14159265931.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11378702241 + 2577592900 = 106671^2 + 50770^2 .
It is a cyclic number.
It is not a de Polignac number, because 13956295141 - 219 = 13955770853 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13956295091 and 13956295100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13956295151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6978147570 + 6978147571.
It is an arithmetic number, because the mean of its divisors is an integer number (6978147571).
Almost surely, 213956295141 is an apocalyptic number.
It is an amenable number.
13956295141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13956295141 is an equidigital number, since it uses as much as digits as its factorization.
13956295141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 291600, while the sum is 46.
The spelling of 13956295141 in words is "thirteen billion, nine hundred fifty-six million, two hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •