Base | Representation |
---|---|
bin | 1100110101101010110001… |
… | …1010110111110001110101 |
3 | 1211222111021010112112111222 |
4 | 3031122230122313301311 |
5 | 3322234341221310041 |
6 | 50004512221240125 |
7 | 2654600325644363 |
oct | 315325432676165 |
9 | 54874233475458 |
10 | 14116155260021 |
11 | 455269a700751 |
12 | 16bb97ba03045 |
13 | 7b51bc73aa39 |
14 | 36b322d18633 |
15 | 1972d859b74b |
hex | cd6ac6b7c75 |
14116155260021 has 2 divisors, whose sum is σ = 14116155260022. Its totient is φ = 14116155260020.
The previous prime is 14116155259991. The next prime is 14116155260041. The reversal of 14116155260021 is 12006255161141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13880944809796 + 235210450225 = 3725714^2 + 484985^2 .
It is an emirp because it is prime and its reverse (12006255161141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14116155260021 - 226 = 14116088151157 is a prime.
It is a super-2 number, since 2×141161552600212 (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 (14116155260041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7058077630010 + 7058077630011.
It is an arithmetic number, because the mean of its divisors is an integer number (7058077630011).
Almost surely, 214116155260021 is an apocalyptic number.
It is an amenable number.
14116155260021 is a deficient number, since it is larger than the sum of its proper divisors (1).
14116155260021 is an equidigital number, since it uses as much as digits as its factorization.
14116155260021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 35.
The spelling of 14116155260021 in words is "fourteen trillion, one hundred sixteen billion, one hundred fifty-five million, two hundred sixty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •