Base | Representation |
---|---|
bin | 1100110111011101100010… |
… | …0010001100111111101111 |
3 | 1212002102202222101010001222 |
4 | 3031313120202030333233 |
5 | 3323240433244304021 |
6 | 50031005045053555 |
7 | 2660040601125626 |
oct | 315673042147757 |
9 | 55072688333058 |
10 | 14146960150511 |
11 | 4564768215931 |
12 | 17059383b72bb |
13 | 7b808b7a89a6 |
14 | 36ca062026bd |
15 | 197edcbb66ab |
hex | cddd888cfef |
14146960150511 has 2 divisors, whose sum is σ = 14146960150512. Its totient is φ = 14146960150510.
The previous prime is 14146960150507. The next prime is 14146960150553. The reversal of 14146960150511 is 11505106964141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14146960150511 - 22 = 14146960150507 is a prime.
It is a super-2 number, since 2×141469601505112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14146960150501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7073480075255 + 7073480075256.
It is an arithmetic number, because the mean of its divisors is an integer number (7073480075256).
Almost surely, 214146960150511 is an apocalyptic number.
14146960150511 is a deficient number, since it is larger than the sum of its proper divisors (1).
14146960150511 is an equidigital number, since it uses as much as digits as its factorization.
14146960150511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 44.
The spelling of 14146960150511 in words is "fourteen trillion, one hundred forty-six billion, nine hundred sixty million, one hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •