Base | Representation |
---|---|
bin | 11011100000110010111101… |
… | …101100011101000111100001 |
3 | 120212102120201211011012210211 |
4 | 123200302331230131013201 |
5 | 111324440022302212322 |
6 | 1105203031554454121 |
7 | 34326014416114603 |
oct | 3340627554350741 |
9 | 525376654135724 |
10 | 121001001210337 |
11 | 3561126676a266 |
12 | 116a297a594341 |
13 | 5269464c67561 |
14 | 21c46a045b173 |
15 | dec7a8c3bb77 |
hex | 6e0cbdb1d1e1 |
121001001210337 has 2 divisors, whose sum is σ = 121001001210338. Its totient is φ = 121001001210336.
The previous prime is 121001001210289. The next prime is 121001001210361. The reversal of 121001001210337 is 733012100100121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108240074014801 + 12760927195536 = 10403849^2 + 3572244^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121001001210337 is a prime.
It is a super-2 number, since 2×1210010012103372 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121001001210437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60500500605168 + 60500500605169.
It is an arithmetic number, because the mean of its divisors is an integer number (60500500605169).
Almost surely, 2121001001210337 is an apocalyptic number.
It is an amenable number.
121001001210337 is a deficient number, since it is larger than the sum of its proper divisors (1).
121001001210337 is an equidigital number, since it uses as much as digits as its factorization.
121001001210337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 121001001210337 its reverse (733012100100121), we get a palindrome (854013101310458).
The spelling of 121001001210337 in words is "one hundred twenty-one trillion, one billion, one million, two hundred ten thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •