Base | Representation |
---|---|
bin | 10010111100010001000011… |
… | …01100111000011110111001 |
3 | 12110111000002012211102000120 |
4 | 21132020201230320132321 |
5 | 20424421132003003200 |
6 | 224331110254523453 |
7 | 11526225043240521 |
oct | 1136104154703671 |
9 | 173430065742016 |
10 | 41653158250425 |
11 | 122aa006a33927 |
12 | 48087b2506589 |
13 | 1a31b50672047 |
14 | a40048b34681 |
15 | 4c37630989a0 |
hex | 25e221b387b9 |
41653158250425 has 24 divisors (see below), whose sum is σ = 69216131419776. Its totient is φ = 22102251138240.
The previous prime is 41653158250399. The next prime is 41653158250427. The reversal of 41653158250425 is 52405285135614.
41653158250425 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 41653158250425 - 210 = 41653158249401 is a prime.
It is not an unprimeable number, because it can be changed into a prime (41653158250427) 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 23 ways as a sum of consecutive naturals, for example, 1409567569 + ... + 1409597118.
It is an arithmetic number, because the mean of its divisors is an integer number (2884005475824).
Almost surely, 241653158250425 is an apocalyptic number.
It is an amenable number.
41653158250425 is a deficient number, since it is larger than the sum of its proper divisors (27562973169351).
41653158250425 is a wasteful number, since it uses less digits than its factorization.
41653158250425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2819164897 (or 2819164892 counting only the distinct ones).
The product of its (nonzero) digits is 5760000, while the sum is 51.
The spelling of 41653158250425 in words is "forty-one trillion, six hundred fifty-three billion, one hundred fifty-eight million, two hundred fifty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •