Base | Representation |
---|---|
bin | 1001101001011001010101… |
… | …01110001011010110101001 |
3 | 2210002222220111010022210001 |
4 | 10310230222232023112221 |
5 | 10240030332404120040 |
6 | 113041213001223001 |
7 | 4316425540513123 |
oct | 464545256132651 |
9 | 83088814108701 |
10 | 21213560223145 |
11 | 6839690789514 |
12 | 24673b6491a61 |
13 | bab57904cc04 |
14 | 534a556a2213 |
15 | 26bc3028559a |
hex | 134b2ab8b5a9 |
21213560223145 has 8 divisors (see below), whose sum is σ = 26277442341120. Its totient is φ = 16423401462960.
The previous prime is 21213560223143. The next prime is 21213560223181. The reversal of 21213560223145 is 54132206531212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21213560223145 - 21 = 21213560223143 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21213560223143) 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, 68430839275 + ... + 68430839584.
It is an arithmetic number, because the mean of its divisors is an integer number (3284680292640).
Almost surely, 221213560223145 is an apocalyptic number.
It is an amenable number.
21213560223145 is a deficient number, since it is larger than the sum of its proper divisors (5063882117975).
21213560223145 is a wasteful number, since it uses less digits than its factorization.
21213560223145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136861678895.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 21213560223145 its reverse (54132206531212), we get a palindrome (75345766754357).
The spelling of 21213560223145 in words is "twenty-one trillion, two hundred thirteen billion, five hundred sixty million, two hundred twenty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •