Base | Representation |
---|---|
bin | 100000110110001… |
… | …0110011111011101 |
3 | 2211210212210101202 |
4 | 1001230112133131 |
5 | 4224122124001 |
6 | 301210445245 |
7 | 36212040122 |
oct | 10154263735 |
9 | 2753783352 |
10 | 1102145501 |
11 | 516150256 |
12 | 269133825 |
13 | 147452402 |
14 | a653a749 |
15 | 66b5b96b |
hex | 41b167dd |
1102145501 has 4 divisors (see below), whose sum is σ = 1102304832. Its totient is φ = 1101986172.
The previous prime is 1102145491. The next prime is 1102145509. The reversal of 1102145501 is 1055412011.
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 a de Polignac number, because none of the positive numbers 2k-1102145501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102145509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68795 + ... + 83288.
It is an arithmetic number, because the mean of its divisors is an integer number (275576208).
Almost surely, 21102145501 is an apocalyptic number.
It is an amenable number.
1102145501 is a deficient number, since it is larger than the sum of its proper divisors (159331).
1102145501 is an equidigital number, since it uses as much as digits as its factorization.
1102145501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159330.
The product of its (nonzero) digits is 200, while the sum is 20.
The square root of 1102145501 is about 33198.5767917843. The cubic root of 1102145501 is about 1032.9508183804.
Adding to 1102145501 its reverse (1055412011), we get a palindrome (2157557512).
The spelling of 1102145501 in words is "one billion, one hundred two million, one hundred forty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •