Base | Representation |
---|---|
bin | 1100110001111111111000… |
… | …1110000111111010011111 |
3 | 1211202110111220211222220102 |
4 | 3030133332032013322133 |
5 | 3320221223400444021 |
6 | 45515523443411315 |
7 | 2650205665531151 |
oct | 314377616077237 |
9 | 54673456758812 |
10 | 14053103140511 |
11 | 45289843a5076 |
12 | 16ab703983b3b |
13 | 7ac28187b296 |
14 | 368260d72ad1 |
15 | 195847e0c00b |
hex | cc7fe387e9f |
14053103140511 has 2 divisors, whose sum is σ = 14053103140512. Its totient is φ = 14053103140510.
The previous prime is 14053103140507. The next prime is 14053103140519. The reversal of 14053103140511 is 11504130135041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14053103140511 - 22 = 14053103140507 is a prime.
It is a super-5 number, since 5×140531031405115 (a number of 67 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14053103140519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026551570255 + 7026551570256.
It is an arithmetic number, because the mean of its divisors is an integer number (7026551570256).
Almost surely, 214053103140511 is an apocalyptic number.
14053103140511 is a deficient number, since it is larger than the sum of its proper divisors (1).
14053103140511 is an equidigital number, since it uses as much as digits as its factorization.
14053103140511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 14053103140511 its reverse (11504130135041), we get a palindrome (25557233275552).
The spelling of 14053103140511 in words is "fourteen trillion, fifty-three billion, one hundred three million, one hundred forty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •