Base | Representation |
---|---|
bin | 11011010011010000000010… |
… | …101001000010111010011001 |
3 | 120202010121001012110100201001 |
4 | 123103100002221002322121 |
5 | 111214212131402304431 |
6 | 1103211244311425001 |
7 | 34201532151534631 |
oct | 3323200251027231 |
9 | 522117035410631 |
10 | 120070150041241 |
11 | 35292512526504 |
12 | 11572496385161 |
13 | 51cc749988c0a |
14 | 21915d79816c1 |
15 | dd3478002e61 |
hex | 6d3402a42e99 |
120070150041241 has 2 divisors, whose sum is σ = 120070150041242. Its totient is φ = 120070150041240.
The previous prime is 120070150041199. The next prime is 120070150041271. The reversal of 120070150041241 is 142140051070021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116135861923225 + 3934288118016 = 10776635^2 + 1983504^2 .
It is an emirp because it is prime and its reverse (142140051070021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120070150041241 - 27 = 120070150041113 is a prime.
It is a super-2 number, since 2×1200701500412412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120070150041271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60035075020620 + 60035075020621.
It is an arithmetic number, because the mean of its divisors is an integer number (60035075020621).
Almost surely, 2120070150041241 is an apocalyptic number.
It is an amenable number.
120070150041241 is a deficient number, since it is larger than the sum of its proper divisors (1).
120070150041241 is an equidigital number, since it uses as much as digits as its factorization.
120070150041241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2240, while the sum is 28.
The spelling of 120070150041241 in words is "one hundred twenty trillion, seventy billion, one hundred fifty million, forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •