Base | Representation |
---|---|
bin | 11011100011000101000101… |
… | …011111010110111111011011 |
3 | 120212222120201020201020221122 |
4 | 123203011011133112333123 |
5 | 111340022333431121103 |
6 | 1105403100423555455 |
7 | 34343240444306225 |
oct | 3343050537267733 |
9 | 525876636636848 |
10 | 121157898301403 |
11 | 3567185a013a77 |
12 | 11709266bbbb8b |
13 | 527b1aa3cb092 |
14 | 21cc105c1b415 |
15 | e018dd0a8b38 |
hex | 6e31457d6fdb |
121157898301403 has 2 divisors, whose sum is σ = 121157898301404. Its totient is φ = 121157898301402.
The previous prime is 121157898301387. The next prime is 121157898301459. The reversal of 121157898301403 is 304103898751121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121157898301403 - 24 = 121157898301387 is a prime.
It is a super-3 number, since 3×1211578983014033 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (121157898309403) 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, 60578949150701 + 60578949150702.
It is an arithmetic number, because the mean of its divisors is an integer number (60578949150702).
Almost surely, 2121157898301403 is an apocalyptic number.
121157898301403 is a deficient number, since it is larger than the sum of its proper divisors (1).
121157898301403 is an equidigital number, since it uses as much as digits as its factorization.
121157898301403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 53.
The spelling of 121157898301403 in words is "one hundred twenty-one trillion, one hundred fifty-seven billion, eight hundred ninety-eight million, three hundred one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •