Base | Representation |
---|---|
bin | 1100110000001100011100… |
… | …0001000111000101111001 |
3 | 1211122111112002221200020012 |
4 | 3030003013001013011321 |
5 | 3314214241211230241 |
6 | 45453400332311305 |
7 | 2645031004141004 |
oct | 314030701070571 |
9 | 54574462850205 |
10 | 14022112211321 |
11 | 45168208732a5 |
12 | 16a56b5012535 |
13 | 7a9383103966 |
14 | 36696109c53b |
15 | 194b322e46eb |
hex | cc0c7047179 |
14022112211321 has 8 divisors (see below), whose sum is σ = 14772108489600. Its totient is φ = 13273314970320.
The previous prime is 14022112211297. The next prime is 14022112211333. The reversal of 14022112211321 is 12311221122041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14022112211321 - 242 = 9624065700217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14022112211021) 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 7 ways as a sum of consecutive naturals, for example, 299735306 + ... + 299782083.
It is an arithmetic number, because the mean of its divisors is an integer number (1846513561200).
Almost surely, 214022112211321 is an apocalyptic number.
It is an amenable number.
14022112211321 is a deficient number, since it is larger than the sum of its proper divisors (749996278279).
14022112211321 is a wasteful number, since it uses less digits than its factorization.
14022112211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599518639.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 14022112211321 its reverse (12311221122041), we get a palindrome (26333333333362).
The spelling of 14022112211321 in words is "fourteen trillion, twenty-two billion, one hundred twelve million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •