Base | Representation |
---|---|
bin | 1001001100100001001101… |
… | …10001100001000010010011 |
3 | 2122121010212002212001010201 |
4 | 10212100212301201002103 |
5 | 10122301314233403042 |
6 | 111001321333040031 |
7 | 4154642031424663 |
oct | 446204661410223 |
9 | 78533762761121 |
10 | 20221356544147 |
11 | 6496913665a20 |
12 | 232704b486017 |
13 | b38b34052785 |
14 | 4dca0c8641a3 |
15 | 25100d1d51b7 |
hex | 126426c61093 |
20221356544147 has 8 divisors (see below), whose sum is σ = 22228056050112. Its totient is φ = 18242722765800.
The previous prime is 20221356544139. The next prime is 20221356544159. The reversal of 20221356544147 is 74144565312202.
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 20221356544147 - 23 = 20221356544139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20221356544097 and 20221356544106.
It is not an unprimeable number, because it can be changed into a prime (20221356544177) 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 7 ways as a sum of consecutive naturals, for example, 7016430393 + ... + 7016433274.
It is an arithmetic number, because the mean of its divisors is an integer number (2778507006264).
Almost surely, 220221356544147 is an apocalyptic number.
20221356544147 is a deficient number, since it is larger than the sum of its proper divisors (2006699505965).
20221356544147 is a wasteful number, since it uses less digits than its factorization.
20221356544147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14032863809.
The product of its (nonzero) digits is 1612800, while the sum is 46.
The spelling of 20221356544147 in words is "twenty trillion, two hundred twenty-one billion, three hundred fifty-six million, five hundred forty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •