Base | Representation |
---|---|
bin | 1010000100011001000100… |
… | …10111100011110111011011 |
3 | 2220101200010121222020020211 |
4 | 11002030202113203313123 |
5 | 10400230020022344233 |
6 | 115031255053231551 |
7 | 4443433626235354 |
oct | 502144227436733 |
9 | 86350117866224 |
10 | 22141133012443 |
11 | 7067002404a85 |
12 | 25971247925b7 |
13 | c47b91078c53 |
14 | 5678ca9ccd2b |
15 | 285e1d28c5cd |
hex | 1423225e3ddb |
22141133012443 has 8 divisors (see below), whose sum is σ = 22168462208816. Its totient is φ = 22113815724000.
The previous prime is 22141133012441. The next prime is 22141133012447. The reversal of 22141133012443 is 34421033114122.
It is a happy number.
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 22141133012443 - 21 = 22141133012441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22141133012441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 746905 + ... + 6696277.
It is an arithmetic number, because the mean of its divisors is an integer number (2771057776102).
Almost surely, 222141133012443 is an apocalyptic number.
22141133012443 is a deficient number, since it is larger than the sum of its proper divisors (27329196373).
22141133012443 is a wasteful number, since it uses less digits than its factorization.
22141133012443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5953965.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 22141133012443 its reverse (34421033114122), we get a palindrome (56562166126565).
The spelling of 22141133012443 in words is "twenty-two trillion, one hundred forty-one billion, one hundred thirty-three million, twelve thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •