Base | Representation |
---|---|
bin | 1100110000001100001011… |
… | …0101101010011011110011 |
3 | 1211122111100020000201121211 |
4 | 3030003002311222123303 |
5 | 3314214120234221431 |
6 | 45453345345500551 |
7 | 2645026163206114 |
oct | 314030265523363 |
9 | 54574306021554 |
10 | 14022042101491 |
11 | 4516795237796 |
12 | 16a5695641757 |
13 | 7a9371727158 |
14 | 366955a4c20b |
15 | 194b2b0962b1 |
hex | cc0c2d6a6f3 |
14022042101491 has 2 divisors, whose sum is σ = 14022042101492. Its totient is φ = 14022042101490.
The previous prime is 14022042101399. The next prime is 14022042101497. The reversal of 14022042101491 is 19410124022041.
14022042101491 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (19410124022041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14022042101491 - 27 = 14022042101363 is a prime.
It is a super-3 number, since 3×140220421014913 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (14022042101497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7011021050745 + 7011021050746.
It is an arithmetic number, because the mean of its divisors is an integer number (7011021050746).
Almost surely, 214022042101491 is an apocalyptic number.
14022042101491 is a deficient number, since it is larger than the sum of its proper divisors (1).
14022042101491 is an equidigital number, since it uses as much as digits as its factorization.
14022042101491 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 31.
The spelling of 14022042101491 in words is "fourteen trillion, twenty-two billion, forty-two million, one hundred one thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •