Base | Representation |
---|---|
bin | 111011101100100000101… |
… | …100101001110100101101 |
3 | 112112011121022200221012102 |
4 | 323230200230221310231 |
5 | 1014202343020003422 |
6 | 12420313310144445 |
7 | 602243250411302 |
oct | 73544054516455 |
9 | 15464538627172 |
10 | 4102242344237 |
11 | 1341829949124 |
12 | 5630607b2125 |
13 | 239abc04438b |
14 | 10279a1010a9 |
15 | 71a96ec8192 |
hex | 3bb20b29d2d |
4102242344237 has 2 divisors, whose sum is σ = 4102242344238. Its totient is φ = 4102242344236.
The previous prime is 4102242344149. The next prime is 4102242344279. The reversal of 4102242344237 is 7324432422014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3335393605636 + 766848738601 = 1826306^2 + 875699^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102242344237 - 214 = 4102242327853 is a prime.
It is a super-2 number, since 2×41022423442372 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4102242344237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4102242341237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051121172118 + 2051121172119.
It is an arithmetic number, because the mean of its divisors is an integer number (2051121172119).
Almost surely, 24102242344237 is an apocalyptic number.
It is an amenable number.
4102242344237 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102242344237 is an equidigital number, since it uses as much as digits as its factorization.
4102242344237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 258048, while the sum is 38.
The spelling of 4102242344237 in words is "four trillion, one hundred two billion, two hundred forty-two million, three hundred forty-four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •