Base | Representation |
---|---|
bin | 100001011111111… |
… | …1110001110011001 |
3 | 2220100010110221112 |
4 | 1002333332032121 |
5 | 4300230104301 |
6 | 303312350105 |
7 | 36566255636 |
oct | 10277761631 |
9 | 2810113845 |
10 | 1124066201 |
11 | 527562635 |
12 | 274545335 |
13 | 14bb58b3b |
14 | a940518d |
15 | 68a3b9bb |
hex | 42ffe399 |
1124066201 has 4 divisors (see below), whose sum is σ = 1183227600. Its totient is φ = 1064904804.
The previous prime is 1124066183. The next prime is 1124066213. The reversal of 1124066201 is 1026604211.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1026604211 = 17 ⋅60388483.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1124066201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1124069201) 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 3 ways as a sum of consecutive naturals, for example, 29580671 + ... + 29580708.
It is an arithmetic number, because the mean of its divisors is an integer number (295806900).
Almost surely, 21124066201 is an apocalyptic number.
It is an amenable number.
1124066201 is a deficient number, since it is larger than the sum of its proper divisors (59161399).
1124066201 is an equidigital number, since it uses as much as digits as its factorization.
1124066201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59161398.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 1124066201 is about 33527.0965190844. The cubic root of 1124066201 is about 1039.7540718427.
The spelling of 1124066201 in words is "one billion, one hundred twenty-four million, sixty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •