Base | Representation |
---|---|
bin | 111011101100110111101… |
… | …010000100001011101101 |
3 | 112112012121011111222211122 |
4 | 323230313222010023231 |
5 | 1014204140122313431 |
6 | 12420415430230325 |
7 | 602255635502141 |
oct | 73546752041355 |
9 | 15465534458748 |
10 | 4102627541741 |
11 | 1341a07323773 |
12 | 5631497b53a5 |
13 | 239b50aa21b1 |
14 | 1027d5331221 |
15 | 71abac15a7b |
hex | 3bb37a842ed |
4102627541741 has 2 divisors, whose sum is σ = 4102627541742. Its totient is φ = 4102627541740.
The previous prime is 4102627541681. The next prime is 4102627541777. The reversal of 4102627541741 is 1471457262014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3821356419241 + 281271122500 = 1954829^2 + 530350^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102627541741 - 226 = 4102560432877 is a prime.
It is a super-2 number, since 2×41026275417412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4102627541692 and 4102627541701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4102627541941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051313770870 + 2051313770871.
It is an arithmetic number, because the mean of its divisors is an integer number (2051313770871).
Almost surely, 24102627541741 is an apocalyptic number.
It is an amenable number.
4102627541741 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102627541741 is an equidigital number, since it uses as much as digits as its factorization.
4102627541741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 376320, while the sum is 44.
The spelling of 4102627541741 in words is "four trillion, one hundred two billion, six hundred twenty-seven million, five hundred forty-one thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •