Base | Representation |
---|---|
bin | 100000001110100010101… |
… | …1000100000110110110001 |
3 | 120200102201210222020022212 |
4 | 1000131011120200312301 |
5 | 1040032123441223423 |
6 | 13230440410141505 |
7 | 635001400106225 |
oct | 100350530406661 |
9 | 16612653866285 |
10 | 4429275336113 |
11 | 1458499502321 |
12 | 5b650b421895 |
13 | 2618a9635564 |
14 | 1145415d2785 |
15 | 7a337a87578 |
hex | 40745620db1 |
4429275336113 has 2 divisors, whose sum is σ = 4429275336114. Its totient is φ = 4429275336112.
The previous prime is 4429275336071. The next prime is 4429275336133. The reversal of 4429275336113 is 3116335729244.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3327734827264 + 1101540508849 = 1824208^2 + 1049543^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4429275336113 is a prime.
It is a super-3 number, since 3×44292753361133 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (4429275336133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2214637668056 + 2214637668057.
It is an arithmetic number, because the mean of its divisors is an integer number (2214637668057).
Almost surely, 24429275336113 is an apocalyptic number.
It is an amenable number.
4429275336113 is a deficient number, since it is larger than the sum of its proper divisors (1).
4429275336113 is an equidigital number, since it uses as much as digits as its factorization.
4429275336113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3265920, while the sum is 50.
The spelling of 4429275336113 in words is "four trillion, four hundred twenty-nine billion, two hundred seventy-five million, three hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •