Base | Representation |
---|---|
bin | 10010101111011101110010… |
… | …10111010100011100011011 |
3 | 12101220221210012122021102222 |
4 | 21113232321113110130123 |
5 | 20400214340200300011 |
6 | 223353045514214255 |
7 | 11452364342206112 |
oct | 1127567127243433 |
9 | 171827705567388 |
10 | 41213321103131 |
11 | 1214a520374101 |
12 | 4757501a2438b |
13 | 19cc5269304c8 |
14 | a26a41c76c79 |
15 | 4b70be135ddb |
hex | 257bb95d471b |
41213321103131 has 2 divisors, whose sum is σ = 41213321103132. Its totient is φ = 41213321103130.
The previous prime is 41213321103043. The next prime is 41213321103151. The reversal of 41213321103131 is 13130112331214.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41213321103131 is a prime.
It is a super-2 number, since 2×412133211031312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41213321103131.
It is not a weakly prime, because it can be changed into another prime (41213321103151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20606660551565 + 20606660551566.
It is an arithmetic number, because the mean of its divisors is an integer number (20606660551566).
Almost surely, 241213321103131 is an apocalyptic number.
41213321103131 is a deficient number, since it is larger than the sum of its proper divisors (1).
41213321103131 is an equidigital number, since it uses as much as digits as its factorization.
41213321103131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 41213321103131 its reverse (13130112331214), we get a palindrome (54343433434345).
The spelling of 41213321103131 in words is "forty-one trillion, two hundred thirteen billion, three hundred twenty-one million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •