Base | Representation |
---|---|
bin | 11011100001000100110111… |
… | …010101111111101110001111 |
3 | 120212111102100100111010022010 |
4 | 123201010313111333232033 |
5 | 111330243403313343203 |
6 | 1105215531131152303 |
7 | 34330264630204245 |
oct | 3341046725775617 |
9 | 525442310433263 |
10 | 121020222012303 |
11 | 3561942a376269 |
12 | 116a66435a5693 |
13 | 526b209093763 |
14 | 21c55a5070795 |
15 | ded03138e303 |
hex | 6e113757fb8f |
121020222012303 has 32 divisors (see below), whose sum is σ = 171625137914880. Its totient is φ = 75591195079680.
The previous prime is 121020222012251. The next prime is 121020222012307. The reversal of 121020222012303 is 303210222020121.
It is not a de Polignac number, because 121020222012303 - 214 = 121020221995919 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121020222012303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121020222012307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10826076 + ... + 18953742.
It is an arithmetic number, because the mean of its divisors is an integer number (5363285559840).
Almost surely, 2121020222012303 is an apocalyptic number.
121020222012303 is a deficient number, since it is larger than the sum of its proper divisors (50604915902577).
121020222012303 is a wasteful number, since it uses less digits than its factorization.
121020222012303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8129007.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 121020222012303 its reverse (303210222020121), we get a palindrome (424230444032424).
The spelling of 121020222012303 in words is "one hundred twenty-one trillion, twenty billion, two hundred twenty-two million, twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •