Base | Representation |
---|---|
bin | 111000011111101111… |
… | …1100001101000001101 |
3 | 102121011022002200112211 |
4 | 1300333133201220031 |
5 | 3441433011004401 |
6 | 131422521030421 |
7 | 11523346434355 |
oct | 1607737415015 |
9 | 377138080484 |
10 | 121324313101 |
11 | 474a9459162 |
12 | 1b61b325411 |
13 | b5966859a4 |
14 | 5c2d195b65 |
15 | 3251399951 |
hex | 1c3f7e1a0d |
121324313101 has 4 divisors (see below), whose sum is σ = 121584108672. Its totient is φ = 121064517532.
The previous prime is 121324313063. The next prime is 121324313107. The reversal of 121324313101 is 101313423121.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101313423121 = 199 ⋅509112679.
It is a cyclic number.
It is not a de Polignac number, because 121324313101 - 215 = 121324280333 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 (121324313107) 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, 129897085 + ... + 129898018.
It is an arithmetic number, because the mean of its divisors is an integer number (30396027168).
Almost surely, 2121324313101 is an apocalyptic number.
It is an amenable number.
121324313101 is a deficient number, since it is larger than the sum of its proper divisors (259795571).
121324313101 is an equidigital number, since it uses as much as digits as its factorization.
121324313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259795570.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121324313101 its reverse (101313423121), we get a palindrome (222637736222).
The spelling of 121324313101 in words is "one hundred twenty-one billion, three hundred twenty-four million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •