Base | Representation |
---|---|
bin | 11011100110101000110100… |
… | …000111101001110010010101 |
3 | 120220211221212101110002020020 |
4 | 123212220310013221302111 |
5 | 111403024124010311013 |
6 | 1110111300220455353 |
7 | 34400015066451303 |
oct | 3346506407516225 |
9 | 526757771402206 |
10 | 121402420010133 |
11 | 35756528160979 |
12 | 117487289aa559 |
13 | 52982785073b2 |
14 | 21d9ca0c27273 |
15 | e07e4ee90623 |
hex | 6e6a341e9c95 |
121402420010133 has 32 divisors (see below), whose sum is σ = 168086656448640. Its totient is φ = 77848273601280.
The previous prime is 121402420010117. The next prime is 121402420010149. The reversal of 121402420010133 is 331010024204121.
It is an interprime number because it is at equal distance from previous prime (121402420010117) and next prime (121402420010149).
It is not a de Polignac number, because 121402420010133 - 24 = 121402420010117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121402420011133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22755363 + ... + 27579183.
It is an arithmetic number, because the mean of its divisors is an integer number (5252708014020).
Almost surely, 2121402420010133 is an apocalyptic number.
It is an amenable number.
121402420010133 is a deficient number, since it is larger than the sum of its proper divisors (46684236438507).
121402420010133 is a wasteful number, since it uses less digits than its factorization.
121402420010133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4824949.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 121402420010133 its reverse (331010024204121), we get a palindrome (452412444214254).
The spelling of 121402420010133 in words is "one hundred twenty-one trillion, four hundred two billion, four hundred twenty million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •