Base | Representation |
---|---|
bin | 10010110010011001100011… |
… | …01000001111010001011101 |
3 | 12102021120222021021211220021 |
4 | 21121030301220033101131 |
5 | 20403342311000132000 |
6 | 223511240205552141 |
7 | 11462563324506250 |
oct | 1131146150172135 |
9 | 172246867254807 |
10 | 41314123052125 |
11 | 12189248451370 |
12 | 4772b54275651 |
13 | 1a08b9c625c81 |
14 | a2b88560d097 |
15 | 4b9a1d98011a |
hex | 259331a0f45d |
41314123052125 has 64 divisors (see below), whose sum is σ = 65163214351872. Its totient is φ = 25401460032000.
The previous prime is 41314123052119. The next prime is 41314123052129. The reversal of 41314123052125 is 52125032141314.
It is not a de Polignac number, because 41314123052125 - 215 = 41314123019357 is a prime.
It is a super-2 number, since 2×413141230521252 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41314123052129) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28697214 + ... + 30102463.
It is an arithmetic number, because the mean of its divisors is an integer number (1018175224248).
Almost surely, 241314123052125 is an apocalyptic number.
It is an amenable number.
41314123052125 is a deficient number, since it is larger than the sum of its proper divisors (23849091299747).
41314123052125 is a wasteful number, since it uses less digits than its factorization.
41314123052125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58799783 (or 58799773 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 41314123052125 its reverse (52125032141314), we get a palindrome (93439155193439).
The spelling of 41314123052125 in words is "forty-one trillion, three hundred fourteen billion, one hundred twenty-three million, fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •