Base | Representation |
---|---|
bin | 1100110010000110111101… |
… | …1110110010101001000101 |
3 | 1211202122102100101220000212 |
4 | 3030201233132302221011 |
5 | 3320234121323211422 |
6 | 45520440203245205 |
7 | 2650304041111364 |
oct | 314415736625105 |
9 | 54678370356025 |
10 | 14055003335237 |
11 | 4529769a73537 |
12 | 16abb54219805 |
13 | 7ac4c544c667 |
14 | 3683a148b7db |
15 | 195909b579e2 |
hex | cc86f7b2a45 |
14055003335237 has 2 divisors, whose sum is σ = 14055003335238. Its totient is φ = 14055003335236.
The previous prime is 14055003335203. The next prime is 14055003335357. The reversal of 14055003335237 is 73253330055041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12377126116996 + 1677877218241 = 3518114^2 + 1295329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14055003335237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14055003335194 and 14055003335203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14055003335537) 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 as a sum of consecutive naturals, namely, 7027501667618 + 7027501667619.
It is an arithmetic number, because the mean of its divisors is an integer number (7027501667619).
Almost surely, 214055003335237 is an apocalyptic number.
It is an amenable number.
14055003335237 is a deficient number, since it is larger than the sum of its proper divisors (1).
14055003335237 is an equidigital number, since it uses as much as digits as its factorization.
14055003335237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567000, while the sum is 41.
The spelling of 14055003335237 in words is "fourteen trillion, fifty-five billion, three million, three hundred thirty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •