Base | Representation |
---|---|
bin | 10010101111110100010101… |
… | …10101100100010011001100 |
3 | 12101222010000210000112020111 |
4 | 21113322022311210103030 |
5 | 20400414132400431012 |
6 | 223402410551325404 |
7 | 11453303321113243 |
oct | 1127721265442314 |
9 | 171863023015214 |
10 | 41225425405132 |
11 | 12154671995381 |
12 | 475991b680864 |
13 | 1a00705583997 |
14 | a2746d68595a |
15 | 4b757bb0aba7 |
hex | 257e8ad644cc |
41225425405132 has 12 divisors (see below), whose sum is σ = 72162580346640. Its totient is φ = 20607545306096.
The previous prime is 41225425405049. The next prime is 41225425405139. The reversal of 41225425405132 is 23150452452214.
41225425405132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (41225425405139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1291831168 + ... + 1291863079.
It is an arithmetic number, because the mean of its divisors is an integer number (6013548362220).
Almost surely, 241225425405132 is an apocalyptic number.
It is an amenable number.
41225425405132 is a deficient number, since it is larger than the sum of its proper divisors (30937154941508).
41225425405132 is a wasteful number, since it uses less digits than its factorization.
41225425405132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2583698240 (or 2583698238 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 40.
Adding to 41225425405132 its reverse (23150452452214), we get a palindrome (64375877857346).
The spelling of 41225425405132 in words is "forty-one trillion, two hundred twenty-five billion, four hundred twenty-five million, four hundred five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •