Base | Representation |
---|---|
bin | 1001101001011101111010… |
… | …00011100100011000110001 |
3 | 2210010020020120210100220112 |
4 | 10310232331003210120301 |
5 | 10240100344404213431 |
6 | 113042300342151105 |
7 | 4316543431406012 |
oct | 464567503443061 |
9 | 83106216710815 |
10 | 21216015304241 |
11 | 683a7305a225a |
12 | 2467980722495 |
13 | bab87a882914 |
14 | 534c0977d009 |
15 | 26bd25a8bc2b |
hex | 134bbd0e4631 |
21216015304241 has 8 divisors (see below), whose sum is σ = 21961572552000. Its totient is φ = 20471389424080.
The previous prime is 21216015304223. The next prime is 21216015304243. The reversal of 21216015304241 is 14240351061212.
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-21216015304241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21216015304198 and 21216015304207.
It is not an unprimeable number, because it can be changed into a prime (21216015304243) 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, 232795541 + ... + 232886658.
It is an arithmetic number, because the mean of its divisors is an integer number (2745196569000).
Almost surely, 221216015304241 is an apocalyptic number.
It is an amenable number.
21216015304241 is a deficient number, since it is larger than the sum of its proper divisors (745557247759).
21216015304241 is a wasteful number, since it uses less digits than its factorization.
21216015304241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465683799.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 21216015304241 its reverse (14240351061212), we get a palindrome (35456366365453).
The spelling of 21216015304241 in words is "twenty-one trillion, two hundred sixteen billion, fifteen million, three hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •