Base | Representation |
---|---|
bin | 1110001101101110000… |
… | …1010100101001100011 |
3 | 212100022210110221021112 |
4 | 3203123201110221203 |
5 | 13000110441123321 |
6 | 304103501213535 |
7 | 23433350136125 |
oct | 3433341245143 |
9 | 770283427245 |
10 | 244201114211 |
11 | 9462418755a |
12 | 3b3b25612ab |
13 | 1a04987a622 |
14 | bb685d5215 |
15 | 6543baaa5b |
hex | 38db854a63 |
244201114211 has 8 divisors (see below), whose sum is σ = 244421377200. Its totient is φ = 243980939520.
The previous prime is 244201114193. The next prime is 244201114231. The reversal of 244201114211 is 112411102442.
244201114211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 244201114211 - 218 = 244200852067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (244201114231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6305675 + ... + 6344283.
It is an arithmetic number, because the mean of its divisors is an integer number (30552672150).
Almost surely, 2244201114211 is an apocalyptic number.
244201114211 is a deficient number, since it is larger than the sum of its proper divisors (220262989).
244201114211 is a wasteful number, since it uses less digits than its factorization.
244201114211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44149.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 244201114211 its reverse (112411102442), we get a palindrome (356612216653).
The spelling of 244201114211 in words is "two hundred forty-four billion, two hundred one million, one hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •