Base | Representation |
---|---|
bin | 100010000111100… |
… | …1000001001001001 |
3 | 2221210011200121001 |
4 | 1010033020021021 |
5 | 4321033104301 |
6 | 305333215001 |
7 | 40240530364 |
oct | 10417101111 |
9 | 2853150531 |
10 | 1144816201 |
11 | 5382453a1 |
12 | 27b491461 |
13 | 153242749 |
14 | ac0870db |
15 | 6a789c01 |
hex | 443c8249 |
1144816201 has 4 divisors (see below), whose sum is σ = 1148545552. Its totient is φ = 1141086852.
The previous prime is 1144816163. The next prime is 1144816241. The reversal of 1144816201 is 1026184411.
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 1144816201 - 27 = 1144816073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1144816201.
It is not an unprimeable number, because it can be changed into a prime (1144816241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1864215 + ... + 1864828.
It is an arithmetic number, because the mean of its divisors is an integer number (287136388).
Almost surely, 21144816201 is an apocalyptic number.
It is an amenable number.
1144816201 is a deficient number, since it is larger than the sum of its proper divisors (3729351).
1144816201 is an equidigital number, since it uses as much as digits as its factorization.
1144816201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3729350.
The product of its (nonzero) digits is 1536, while the sum is 28.
The square root of 1144816201 is about 33835.1326434521. The cubic root of 1144816201 is about 1046.1129755123.
The spelling of 1144816201 in words is "one billion, one hundred forty-four million, eight hundred sixteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •