Base | Representation |
---|---|
bin | 111000011001001000… |
… | …0010010000011001001 |
3 | 102120120211011211221001 |
4 | 1300302100102003021 |
5 | 3441004131311241 |
6 | 131344504415001 |
7 | 11515011554215 |
oct | 1606220220311 |
9 | 376524154831 |
10 | 121102213321 |
11 | 473a5051321 |
12 | 1b578a77461 |
13 | b55c6615bb |
14 | 5c0b89d945 |
15 | 323bb27431 |
hex | 1c324120c9 |
121102213321 has 4 divisors (see below), whose sum is σ = 121323607312. Its totient is φ = 120880819332.
The previous prime is 121102213303. The next prime is 121102213327. The reversal of 121102213321 is 123312201121.
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-121102213321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121102213327) 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, 110696175 + ... + 110697268.
It is an arithmetic number, because the mean of its divisors is an integer number (30330901828).
Almost surely, 2121102213321 is an apocalyptic number.
It is an amenable number.
121102213321 is a deficient number, since it is larger than the sum of its proper divisors (221393991).
121102213321 is an equidigital number, since it uses as much as digits as its factorization.
121102213321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221393990.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 121102213321 its reverse (123312201121), we get a palindrome (244414414442).
The spelling of 121102213321 in words is "one hundred twenty-one billion, one hundred two million, two hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •