Base | Representation |
---|---|
bin | 100000001100110100001010… |
… | …110100000000011011001111 |
3 | 200120102120011112110202101002 |
4 | 200030310022310000123033 |
5 | 122030232421320301044 |
6 | 1221110250253210515 |
7 | 41554400323602044 |
oct | 4014641264003317 |
9 | 616376145422332 |
10 | 141618138056399 |
11 | 4113aa07a56994 |
12 | 13a72663a90a3b |
13 | 61036c1343794 |
14 | 26d84d68a11cb |
15 | 1158c2d14974e |
hex | 80cd0ad006cf |
141618138056399 has 2 divisors, whose sum is σ = 141618138056400. Its totient is φ = 141618138056398.
The previous prime is 141618138056321. The next prime is 141618138056431. The reversal of 141618138056399 is 993650831816141.
It is a strong prime.
It is an emirp because it is prime and its reverse (993650831816141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141618138056399 - 216 = 141618137990863 is a prime.
It is a super-2 number, since 2×1416181380563992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141618138056309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70809069028199 + 70809069028200.
It is an arithmetic number, because the mean of its divisors is an integer number (70809069028200).
Almost surely, 2141618138056399 is an apocalyptic number.
141618138056399 is a deficient number, since it is larger than the sum of its proper divisors (1).
141618138056399 is an equidigital number, since it uses as much as digits as its factorization.
141618138056399 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33592320, while the sum is 65.
The spelling of 141618138056399 in words is "one hundred forty-one trillion, six hundred eighteen billion, one hundred thirty-eight million, fifty-six thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •