Base | Representation |
---|---|
bin | 100000110110011… |
… | …1100011111000001 |
3 | 2211211011200212110 |
4 | 1001230330133001 |
5 | 4224142113441 |
6 | 301214045533 |
7 | 36213255615 |
oct | 10154743701 |
9 | 2754150773 |
10 | 1102301121 |
11 | 516247169 |
12 | 2691a98a9 |
13 | 1474a81ac |
14 | a657b345 |
15 | 66b8cb16 |
hex | 41b3c7c1 |
1102301121 has 8 divisors (see below), whose sum is σ = 1469905920. Its totient is φ = 734781872.
The previous prime is 1102301111. The next prime is 1102301129. The reversal of 1102301121 is 1211032011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102301121 - 27 = 1102300993 is a prime.
It is a super-2 number, since 2×11023011212 = 2430135522715713282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102301097 and 1102301106.
It is not an unprimeable number, because it can be changed into a prime (1102301129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20275 + ... + 51143.
It is an arithmetic number, because the mean of its divisors is an integer number (183738240).
Almost surely, 21102301121 is an apocalyptic number.
It is an amenable number.
1102301121 is a deficient number, since it is larger than the sum of its proper divisors (367604799).
1102301121 is a wasteful number, since it uses less digits than its factorization.
1102301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42775.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1102301121 is about 33200.9204842275. The cubic root of 1102301121 is about 1032.9994327243. Note that the first 3 decimals are identical.
Adding to 1102301121 its reverse (1211032011), we get a palindrome (2313333132).
The spelling of 1102301121 in words is "one billion, one hundred two million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •