Base | Representation |
---|---|
bin | 10010110000000101000101… |
… | …00111100001100000111001 |
3 | 12101222222020020020021121212 |
4 | 21120002202213201200321 |
5 | 20401041040030431411 |
6 | 223410454535012505 |
7 | 11454042140421266 |
oct | 1130024247414071 |
9 | 171888206207555 |
10 | 41234414311481 |
11 | 121584649997a6 |
12 | 475b609b0a135 |
13 | 1a0150894b691 |
14 | a27a8341026d |
15 | 4b7905d4568b |
hex | 2580a29e1839 |
41234414311481 has 2 divisors, whose sum is σ = 41234414311482. Its totient is φ = 41234414311480.
The previous prime is 41234414311469. The next prime is 41234414311511. The reversal of 41234414311481 is 18411341443214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39864322992400 + 1370091319081 = 6313820^2 + 1170509^2 .
It is a cyclic number.
It is not a de Polignac number, because 41234414311481 - 226 = 41234347202617 is a prime.
It is a super-2 number, since 2×412344143114812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41234434311481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20617207155740 + 20617207155741.
It is an arithmetic number, because the mean of its divisors is an integer number (20617207155741).
Almost surely, 241234414311481 is an apocalyptic number.
It is an amenable number.
41234414311481 is a deficient number, since it is larger than the sum of its proper divisors (1).
41234414311481 is an equidigital number, since it uses as much as digits as its factorization.
41234414311481 is an evil number, because the sum of its binary digits is even.
The product of its digits is 147456, while the sum is 41.
Adding to 41234414311481 its reverse (18411341443214), we get a palindrome (59645755754695).
The spelling of 41234414311481 in words is "forty-one trillion, two hundred thirty-four billion, four hundred fourteen million, three hundred eleven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •