Base | Representation |
---|---|
bin | 1110011100001… |
… | …01111111110101 |
3 | 22102221022002221 |
4 | 13032011333311 |
5 | 222002310333 |
6 | 20004202341 |
7 | 3000426352 |
oct | 716057765 |
9 | 272838087 |
10 | 121135093 |
11 | 62417652 |
12 | 346993b1 |
13 | 1c133791 |
14 | 12133629 |
15 | a97bd2d |
hex | 7385ff5 |
121135093 has 4 divisors (see below), whose sum is σ = 121168908. Its totient is φ = 121101280.
The previous prime is 121135087. The next prime is 121135109. The reversal of 121135093 is 390531121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 390531121 = 1409 ⋅277169.
It can be written as a sum of positive squares in 2 ways, for example, as 60326289 + 60808804 = 7767^2 + 7798^2 .
It is a cyclic number.
It is not a de Polignac number, because 121135093 - 25 = 121135061 is a prime.
It is a super-2 number, since 2×1211350932 = 29347421512237298, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121135193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10798 + ... + 18943.
It is an arithmetic number, because the mean of its divisors is an integer number (30292227).
Almost surely, 2121135093 is an apocalyptic number.
It is an amenable number.
121135093 is a deficient number, since it is larger than the sum of its proper divisors (33815).
121135093 is an equidigital number, since it uses as much as digits as its factorization.
121135093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33814.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 121135093 is about 11006.1388779172. The cubic root of 121135093 is about 494.7927479823.
The spelling of 121135093 in words is "one hundred twenty-one million, one hundred thirty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •