Base | Representation |
---|---|
bin | 1001101101110010111101… |
… | …11100000011111100111001 |
3 | 2210122110011212102121010101 |
4 | 10312321132330003330321 |
5 | 10300020012043232213 |
6 | 113234500232115401 |
7 | 4333360446530113 |
oct | 466713674037471 |
9 | 83573155377111 |
10 | 21364760133433 |
11 | 6897820131a62 |
12 | 2490772b35b61 |
13 | bbc8c4091a52 |
14 | 53c0ba55c3b3 |
15 | 270b2e383bdd |
hex | 136e5ef03f39 |
21364760133433 has 8 divisors (see below), whose sum is σ = 21460216769280. Its totient is φ = 21269515389360.
The previous prime is 21364760133371. The next prime is 21364760133463. The reversal of 21364760133433 is 33433106746312.
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-21364760133433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21364760133463) 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, 52770835 + ... + 53174152.
It is an arithmetic number, because the mean of its divisors is an integer number (2682527096160).
Almost surely, 221364760133433 is an apocalyptic number.
It is an amenable number.
21364760133433 is a deficient number, since it is larger than the sum of its proper divisors (95456635847).
21364760133433 is a wasteful number, since it uses less digits than its factorization.
21364760133433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105945887.
The product of its (nonzero) digits is 1959552, while the sum is 46.
Adding to 21364760133433 its reverse (33433106746312), we get a palindrome (54797866879745).
The spelling of 21364760133433 in words is "twenty-one trillion, three hundred sixty-four billion, seven hundred sixty million, one hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •