Base | Representation |
---|---|
bin | 11101011011010110001… |
… | …10101111100001101001 |
3 | 10120122212021211112022011 |
4 | 32231223012233201221 |
5 | 113031230221303301 |
6 | 2052255515155521 |
7 | 133023232161235 |
oct | 16555306574151 |
9 | 3518767745264 |
10 | 1011114244201 |
11 | 35a8a16a4086 |
12 | 143b64145ba1 |
13 | 74469a832b9 |
14 | 36d1c5755c5 |
15 | 1b47c370a51 |
hex | eb6b1af869 |
1011114244201 has 4 divisors (see below), whose sum is σ = 1012399015312. Its totient is φ = 1009829473092.
The previous prime is 1011114244181. The next prime is 1011114244219. The reversal of 1011114244201 is 1024424111101.
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 1011114244201 - 25 = 1011114244169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011114244241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 642384375 + ... + 642385948.
It is an arithmetic number, because the mean of its divisors is an integer number (253099753828).
Almost surely, 21011114244201 is an apocalyptic number.
It is an amenable number.
1011114244201 is a deficient number, since it is larger than the sum of its proper divisors (1284771111).
1011114244201 is an equidigital number, since it uses as much as digits as its factorization.
1011114244201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1284771110.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 1011114244201 its reverse (1024424111101), we get a palindrome (2035538355302).
The spelling of 1011114244201 in words is "one trillion, eleven billion, one hundred fourteen million, two hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •