Base | Representation |
---|---|
bin | 11011100011101111000111… |
… | …100100010110100011111111 |
3 | 120220010220012120120102102002 |
4 | 123203233013210112203333 |
5 | 111341242301230241112 |
6 | 1105435523051452515 |
7 | 34346426036200406 |
oct | 3343570744264377 |
9 | 526126176512362 |
10 | 121203030321407 |
11 | 35689a09950661 |
12 | 11715b6175713b |
13 | 5282520784268 |
14 | 21d0387c1463d |
15 | e02b803c41c2 |
hex | 6e3bc79168ff |
121203030321407 has 2 divisors, whose sum is σ = 121203030321408. Its totient is φ = 121203030321406.
The previous prime is 121203030321311. The next prime is 121203030321433. The reversal of 121203030321407 is 704123030302121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121203030321407 - 212 = 121203030317311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121203030321407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121203030321467) 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 as a sum of consecutive naturals, namely, 60601515160703 + 60601515160704.
It is an arithmetic number, because the mean of its divisors is an integer number (60601515160704).
Almost surely, 2121203030321407 is an apocalyptic number.
121203030321407 is a deficient number, since it is larger than the sum of its proper divisors (1).
121203030321407 is an equidigital number, since it uses as much as digits as its factorization.
121203030321407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 121203030321407 its reverse (704123030302121), we get a palindrome (825326060623528).
The spelling of 121203030321407 in words is "one hundred twenty-one trillion, two hundred three billion, thirty million, three hundred twenty-one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •