Base | Representation |
---|---|
bin | 111000010110101110… |
… | …1110001100100000001 |
3 | 102120101012222200122102 |
4 | 1300231131301210001 |
5 | 3440323044123233 |
6 | 131332514320145 |
7 | 11513014605206 |
oct | 1605535614401 |
9 | 376335880572 |
10 | 121021864193 |
11 | 4736376188a |
12 | 1b555b89055 |
13 | b548b0b339 |
14 | 5c00d45cad |
15 | 3234a551e8 |
hex | 1c2d771901 |
121021864193 has 4 divisors (see below), whose sum is σ = 124925795328. Its totient is φ = 117117933060.
The previous prime is 121021864109. The next prime is 121021864211. The reversal of 121021864193 is 391468120121.
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 a de Polignac number, because none of the positive numbers 2k-121021864193 is a prime.
It is a super-2 number, since 2×1210218641932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121021864793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1951965521 + ... + 1951965582.
It is an arithmetic number, because the mean of its divisors is an integer number (31231448832).
Almost surely, 2121021864193 is an apocalyptic number.
It is an amenable number.
121021864193 is a deficient number, since it is larger than the sum of its proper divisors (3903931135).
121021864193 is an equidigital number, since it uses as much as digits as its factorization.
121021864193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3903931134.
The product of its (nonzero) digits is 20736, while the sum is 38.
The spelling of 121021864193 in words is "one hundred twenty-one billion, twenty-one million, eight hundred sixty-four thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •