Base | Representation |
---|---|
bin | 10010110110000110110101… |
… | …01110010101001010110111 |
3 | 12102201202210100221001202022 |
4 | 21123003122232111022313 |
5 | 20412434210044101411 |
6 | 224045545125103355 |
7 | 11505023231231141 |
oct | 1133033256251267 |
9 | 172652710831668 |
10 | 41441514050231 |
11 | 1222827a337789 |
12 | 4793787257b5b |
13 | 1a17bc1b253a9 |
14 | a33acc3b1c91 |
15 | 4bcec7735edb |
hex | 25b0dab952b7 |
41441514050231 has 2 divisors, whose sum is σ = 41441514050232. Its totient is φ = 41441514050230.
The previous prime is 41441514050177. The next prime is 41441514050239. The reversal of 41441514050231 is 13205041514414.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41441514050231 is a prime.
It is a super-2 number, since 2×414415140502312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41441514050191 and 41441514050200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41441514050239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20720757025115 + 20720757025116.
It is an arithmetic number, because the mean of its divisors is an integer number (20720757025116).
Almost surely, 241441514050231 is an apocalyptic number.
41441514050231 is a deficient number, since it is larger than the sum of its proper divisors (1).
41441514050231 is an equidigital number, since it uses as much as digits as its factorization.
41441514050231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 41441514050231 its reverse (13205041514414), we get a palindrome (54646555564645).
The spelling of 41441514050231 in words is "forty-one trillion, four hundred forty-one billion, five hundred fourteen million, fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •