Base | Representation |
---|---|
bin | 10010111001010101110011… |
… | …10000011100000111010101 |
3 | 12110010101121020101110210220 |
4 | 21130222321300130013111 |
5 | 20421244241301321113 |
6 | 224213003103504553 |
7 | 11516035624141212 |
oct | 1134527160340725 |
9 | 173111536343726 |
10 | 41552630104533 |
11 | 1227040a467a19 |
12 | 47b12178b8159 |
13 | 1a2551c604452 |
14 | a3922d8b2b09 |
15 | 4c0d2c7d6523 |
hex | 25cab9c1c1d5 |
41552630104533 has 16 divisors (see below), whose sum is σ = 56487097496640. Its totient is φ = 27164345065344.
The previous prime is 41552630104507. The next prime is 41552630104571. The reversal of 41552630104533 is 33540103625514.
It is a happy number.
41552630104533 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 41552630104533 - 212 = 41552630100437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41552630154533) 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 15 ways as a sum of consecutive naturals, for example, 548337943 + ... + 548413716.
It is an arithmetic number, because the mean of its divisors is an integer number (3530443593540).
Almost surely, 241552630104533 is an apocalyptic number.
It is an amenable number.
41552630104533 is a deficient number, since it is larger than the sum of its proper divisors (14934467392107).
41552630104533 is a wasteful number, since it uses less digits than its factorization.
41552630104533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096751908.
The product of its (nonzero) digits is 648000, while the sum is 42.
The spelling of 41552630104533 in words is "forty-one trillion, five hundred fifty-two billion, six hundred thirty million, one hundred four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •