Base | Representation |
---|---|
bin | 100000110110010… |
… | …0110100001010101 |
3 | 2211211000010110110 |
4 | 1001230212201111 |
5 | 4224131224112 |
6 | 301212113233 |
7 | 36212432415 |
oct | 10154464125 |
9 | 2754003413 |
10 | 1102211157 |
11 | 516195613 |
12 | 269165819 |
13 | 147476268 |
14 | a6556645 |
15 | 66b7113c |
hex | 41b26855 |
1102211157 has 4 divisors (see below), whose sum is σ = 1469614880. Its totient is φ = 734807436.
The previous prime is 1102211119. The next prime is 1102211191. The reversal of 1102211157 is 7511122011.
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 not a de Polignac number, because 1102211157 - 226 = 1035102293 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 (1102211197) 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, 183701857 + ... + 183701862.
It is an arithmetic number, because the mean of its divisors is an integer number (367403720).
Almost surely, 21102211157 is an apocalyptic number.
It is an amenable number.
1102211157 is a deficient number, since it is larger than the sum of its proper divisors (367403723).
1102211157 is an equidigital number, since it uses as much as digits as its factorization.
1102211157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367403722.
The product of its (nonzero) digits is 140, while the sum is 21.
The square root of 1102211157 is about 33199.5656146282. The cubic root of 1102211157 is about 1032.9713293057.
Adding to 1102211157 its reverse (7511122011), we get a palindrome (8613333168).
The spelling of 1102211157 in words is "one billion, one hundred two million, two hundred eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •