Base | Representation |
---|---|
bin | 10000000010010110000… |
… | …111010000000100011001 |
3 | 10220100112101002002111002 |
4 | 100002112013100010121 |
5 | 121023424202023001 |
6 | 2202133213514345 |
7 | 142422222246341 |
oct | 20022607200431 |
9 | 3810471062432 |
10 | 1102030111001 |
11 | 3954062a4486 |
12 | 1596b77a29b5 |
13 | 7cbc8565ca1 |
14 | 3b4a4d5dd21 |
15 | 1d9edd1046b |
hex | 100961d0119 |
1102030111001 has 4 divisors (see below), whose sum is σ = 1102038250512. Its totient is φ = 1102021971492.
The previous prime is 1102030110977. The next prime is 1102030111009. The reversal of 1102030111001 is 1001110302011.
It is a happy number.
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 1102030111001 - 214 = 1102030094617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102030111009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3863171 + ... + 4138616.
It is an arithmetic number, because the mean of its divisors is an integer number (275509562628).
Almost surely, 21102030111001 is an apocalyptic number.
It is an amenable number.
1102030111001 is a deficient number, since it is larger than the sum of its proper divisors (8139511).
1102030111001 is an equidigital number, since it uses as much as digits as its factorization.
1102030111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8139510.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1102030111001 its reverse (1001110302011), we get a palindrome (2103140413012).
The spelling of 1102030111001 in words is "one trillion, one hundred two billion, thirty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •