Base | Representation |
---|---|
bin | 1100110000001101100011… |
… | …0010010001100110110001 |
3 | 1211122112021212212202122021 |
4 | 3030003120302101212301 |
5 | 3314220344014441423 |
6 | 45453450101511441 |
7 | 2645041254020350 |
oct | 314033062214661 |
9 | 54575255782567 |
10 | 14022410312113 |
11 | 451696406a895 |
12 | 16a5778a12581 |
13 | 7a93ccab8168 |
14 | 36698c8d9997 |
15 | 194b4d57a95d |
hex | cc0d8c919b1 |
14022410312113 has 16 divisors (see below), whose sum is σ = 16037660862720. Its totient is φ = 12010173057216.
The previous prime is 14022410312111. The next prime is 14022410312137. The reversal of 14022410312113 is 31121301422041.
It is a cyclic number.
It is not a de Polignac number, because 14022410312113 - 21 = 14022410312111 is a prime.
It is a super-2 number, since 2×140224103121132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14022410312111) 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 in 15 ways as a sum of consecutive naturals, for example, 227557695 + ... + 227619307.
It is an arithmetic number, because the mean of its divisors is an integer number (1002353803920).
Almost surely, 214022410312113 is an apocalyptic number.
It is an amenable number.
14022410312113 is a deficient number, since it is larger than the sum of its proper divisors (2015250550607).
14022410312113 is a wasteful number, since it uses less digits than its factorization.
14022410312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85536.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 14022410312113 its reverse (31121301422041), we get a palindrome (45143711734154).
The spelling of 14022410312113 in words is "fourteen trillion, twenty-two billion, four hundred ten million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •