Base | Representation |
---|---|
bin | 1001101001011001011010… |
… | …00110001010001010000111 |
3 | 2210010000000021002110100021 |
4 | 10310230231012022022013 |
5 | 10240030423104023020 |
6 | 113041220543200011 |
7 | 4316426533246453 |
oct | 464545506121207 |
9 | 83100007073307 |
10 | 21213600064135 |
11 | 6839701220656 |
12 | 24674078a6007 |
13 | bab58438c26b |
14 | 534a5aab3663 |
15 | 26bc33a051aa |
hex | 134b2d18a287 |
21213600064135 has 8 divisors (see below), whose sum is σ = 25456510449216. Its totient is φ = 16970753136480.
The previous prime is 21213600064109. The next prime is 21213600064141. The reversal of 21213600064135 is 53146000631212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21213600064135 - 215 = 21213600031367 is a prime.
It is a super-2 number, since 2×212136000641352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21213600064135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15125776 + ... + 16468645.
It is an arithmetic number, because the mean of its divisors is an integer number (3182063806152).
Almost surely, 221213600064135 is an apocalyptic number.
21213600064135 is a deficient number, since it is larger than the sum of its proper divisors (4242910385081).
21213600064135 is a wasteful number, since it uses less digits than its factorization.
21213600064135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31728713.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 21213600064135 its reverse (53146000631212), we get a palindrome (74359600695347).
The spelling of 21213600064135 in words is "twenty-one trillion, two hundred thirteen billion, six hundred million, sixty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •