Base | Representation |
---|---|
bin | 1001101110110100111111… |
… | …11111010000111011001101 |
3 | 2210202211200111220220210020 |
4 | 10313122133333100323031 |
5 | 10301110113033333123 |
6 | 113303042112132353 |
7 | 4336054120062021 |
oct | 467323777207315 |
9 | 83684614826706 |
10 | 21400211230413 |
11 | 6900862378914 |
12 | 24976075370b9 |
13 | bc30538a7802 |
14 | 53dac0930381 |
15 | 271a0681c7e3 |
hex | 13769ffd0ecd |
21400211230413 has 8 divisors (see below), whose sum is σ = 28533649420128. Its totient is φ = 14266790263824.
The previous prime is 21400211230361. The next prime is 21400211230423. The reversal of 21400211230413 is 31403211200412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21400211230413 - 214 = 21400211214029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21400211230423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1056195 + ... + 6626912.
It is an arithmetic number, because the mean of its divisors is an integer number (3566706177516).
Almost surely, 221400211230413 is an apocalyptic number.
It is an amenable number.
21400211230413 is a deficient number, since it is larger than the sum of its proper divisors (7133438189715).
21400211230413 is an equidigital number, since it uses as much as digits as its factorization.
21400211230413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8611563.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 21400211230413 its reverse (31403211200412), we get a palindrome (52803422430825).
The spelling of 21400211230413 in words is "twenty-one trillion, four hundred billion, two hundred eleven million, two hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •