Base | Representation |
---|---|
bin | 11011100001000100110111… |
… | …011011000001100001101011 |
3 | 120212111102100102222002101221 |
4 | 123201010313123001201223 |
5 | 111330243404133033121 |
6 | 1105215531215322511 |
7 | 34330264644334156 |
oct | 3341046733014153 |
9 | 525442312862357 |
10 | 121020223330411 |
11 | 35619430096609 |
12 | 116a6643b20437 |
13 | 526b2094356c2 |
14 | 21c55a52d4c9d |
15 | ded03154eb41 |
hex | 6e11376c186b |
121020223330411 has 4 divisors (see below), whose sum is σ = 121021095806424. Its totient is φ = 121019350854400.
The previous prime is 121020223330403. The next prime is 121020223330499. The reversal of 121020223330411 is 114033322020121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121020223330411 - 23 = 121020223330403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121020223333411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 436029910 + ... + 436307371.
It is an arithmetic number, because the mean of its divisors is an integer number (30255273951606).
Almost surely, 2121020223330411 is an apocalyptic number.
121020223330411 is a deficient number, since it is larger than the sum of its proper divisors (872476013).
121020223330411 is an equidigital number, since it uses as much as digits as its factorization.
121020223330411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872476012.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 121020223330411 its reverse (114033322020121), we get a palindrome (235053545350532).
The spelling of 121020223330411 in words is "one hundred twenty-one trillion, twenty billion, two hundred twenty-three million, three hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •