Base | Representation |
---|---|
bin | 1001100111000101111100… |
… | …10101101001010001000101 |
3 | 2202211102122221020112022101 |
4 | 10303202332111221101011 |
5 | 10232231304201111123 |
6 | 112541005122232101 |
7 | 4310624636460664 |
oct | 463427625512105 |
9 | 82742587215271 |
10 | 21134432441413 |
11 | 6809076159985 |
12 | 2453bb27b5631 |
13 | ba3c788353a5 |
14 | 530caa6d0ddb |
15 | 269b4d656aad |
hex | 1338be569445 |
21134432441413 has 4 divisors (see below), whose sum is σ = 21134505021120. Its totient is φ = 21134359861708.
The previous prime is 21134432441387. The next prime is 21134432441449. The reversal of 21134432441413 is 31414423443112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21134432441413 - 237 = 20996993487941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21134432441513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35851303 + ... + 36436036.
It is an arithmetic number, because the mean of its divisors is an integer number (5283626255280).
Almost surely, 221134432441413 is an apocalyptic number.
It is an amenable number.
21134432441413 is a deficient number, since it is larger than the sum of its proper divisors (72579707).
21134432441413 is an equidigital number, since it uses as much as digits as its factorization.
21134432441413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72579706.
The product of its digits is 110592, while the sum is 37.
Adding to 21134432441413 its reverse (31414423443112), we get a palindrome (52548855884525).
The spelling of 21134432441413 in words is "twenty-one trillion, one hundred thirty-four billion, four hundred thirty-two million, four hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •