Base | Representation |
---|---|
bin | 1100000010111001110000… |
… | …1010100111101011001011 |
3 | 1201220010002102110100110000 |
4 | 3000232130022213223023 |
5 | 3213442210034000321 |
6 | 44100113405254043 |
7 | 2534563525200135 |
oct | 300563412475313 |
9 | 51803072410400 |
10 | 13244004203211 |
11 | 4246829114091 |
12 | 159a93a264323 |
13 | 750b9a7c0752 |
14 | 33b028400055 |
15 | 17e790de8826 |
hex | c0b9c2a7acb |
13244004203211 has 20 divisors (see below), whose sum is σ = 19823585764752. Its totient is φ = 8811782756208.
The previous prime is 13244004203203. The next prime is 13244004203233. The reversal of 13244004203211 is 11230240044231.
13244004203211 is a `hidden beast` number, since 1 + 3 + 2 + 4 + 400 + 42 + 0 + 3 + 211 = 666.
13244004203211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13244004203211 - 23 = 13244004203203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13244004213211) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 162490296 + ... + 162571781.
Almost surely, 213244004203211 is an apocalyptic number.
13244004203211 is a deficient number, since it is larger than the sum of its proper divisors (6579581561541).
13244004203211 is an equidigital number, since it uses as much as digits as its factorization.
13244004203211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325062592 (or 325062583 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 13244004203211 its reverse (11230240044231), we get a palindrome (24474244247442).
The spelling of 13244004203211 in words is "thirteen trillion, two hundred forty-four billion, four million, two hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •