Base | Representation |
---|---|
bin | 100000110100010… |
… | …0001000011101001 |
3 | 2211201222201101102 |
4 | 1001220201003221 |
5 | 4223342441301 |
6 | 301133131145 |
7 | 36200352200 |
oct | 10150410351 |
9 | 2751881342 |
10 | 1101140201 |
11 | 515623a27 |
12 | 268929ab5 |
13 | 14718c965 |
14 | a6358237 |
15 | 66a0db6b |
hex | 41a210e9 |
1101140201 has 12 divisors (see below), whose sum is σ = 1356267348. Its totient is φ = 888314112.
The previous prime is 1101140197. The next prime is 1101140213. The reversal of 1101140201 is 1020411011.
It can be written as a sum of positive squares in 2 ways, for example, as 421234576 + 679905625 = 20524^2 + 26075^2 .
It is not a de Polignac number, because 1101140201 - 22 = 1101140197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101140251) 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 11 ways as a sum of consecutive naturals, for example, 660116 + ... + 661781.
It is an arithmetic number, because the mean of its divisors is an integer number (113022279).
Almost surely, 21101140201 is an apocalyptic number.
It is an amenable number.
1101140201 is a deficient number, since it is larger than the sum of its proper divisors (255127147).
1101140201 is a wasteful number, since it uses less digits than its factorization.
1101140201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321928 (or 1321921 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1101140201 is about 33183.4326283463. The cubic root of 1101140201 is about 1032.6366610260.
Adding to 1101140201 its reverse (1020411011), we get a palindrome (2121551212).
The spelling of 1101140201 in words is "one billion, one hundred one million, one hundred forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •