Base | Representation |
---|---|
bin | 1001101001011110010100… |
… | …00101110101100000001001 |
3 | 2210010020210211022101102212 |
4 | 10310233022011311200021 |
5 | 10240101321401034231 |
6 | 113042334153434505 |
7 | 4316552025331052 |
oct | 464571205654011 |
9 | 83106724271385 |
10 | 21216234002441 |
11 | 683a832a96475 |
12 | 2467a21a0ba35 |
13 | bab8b3c8593a |
14 | 534c2a82b729 |
15 | 26bd39d8b42b |
hex | 134bca175809 |
21216234002441 has 8 divisors (see below), whose sum is σ = 21290075526720. Its totient is φ = 21142435958928.
The previous prime is 21216234002417. The next prime is 21216234002477. The reversal of 21216234002441 is 14420043261212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21216234002441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21216234002398 and 21216234002407.
It is not an unprimeable number, because it can be changed into a prime (21216234002941) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9892451 + ... + 11844536.
It is an arithmetic number, because the mean of its divisors is an integer number (2661259440840).
Almost surely, 221216234002441 is an apocalyptic number.
It is an amenable number.
21216234002441 is a deficient number, since it is larger than the sum of its proper divisors (73841524279).
21216234002441 is a wasteful number, since it uses less digits than its factorization.
21216234002441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21740383.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 21216234002441 its reverse (14420043261212), we get a palindrome (35636277263653).
The spelling of 21216234002441 in words is "twenty-one trillion, two hundred sixteen billion, two hundred thirty-four million, two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •