Base | Representation |
---|---|
bin | 1100110000001101100011… |
… | …0010010001011100001000 |
3 | 1211122112021212212201201001 |
4 | 3030003120302101130020 |
5 | 3314220344014431212 |
6 | 45453450101504344 |
7 | 2645041254015355 |
oct | 314033062213410 |
9 | 54575255781631 |
10 | 14022410311432 |
11 | 451696406a326 |
12 | 16a5778a120b4 |
13 | 7a93ccab7a63 |
14 | 36698c8d962c |
15 | 194b4d57a657 |
hex | cc0d8c91708 |
14022410311432 has 16 divisors (see below), whose sum is σ = 26404860622140. Its totient is φ = 6981114145536.
The previous prime is 14022410311417. The next prime is 14022410311439. The reversal of 14022410311432 is 23411301422041.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 13941307245636 + 81103065796 = 3733806^2 + 284786^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 14022410311432.
It is not an unprimeable number, because it can be changed into a prime (14022410311439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3761374293 + ... + 3761378020.
Almost surely, 214022410311432 is an apocalyptic number.
It is an amenable number.
14022410311432 is a deficient number, since it is larger than the sum of its proper divisors (12382450310708).
14022410311432 is a wasteful number, since it uses less digits than its factorization.
14022410311432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7522752552 (or 7522752548 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 14022410311432 its reverse (23411301422041), we get a palindrome (37433711733473).
The spelling of 14022410311432 in words is "fourteen trillion, twenty-two billion, four hundred ten million, three hundred eleven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •