Base | Representation |
---|---|
bin | 10010101011000001000101… |
… | …11100111000011101101101 |
3 | 12101101100021000100110211021 |
4 | 21111200202330320131231 |
5 | 20340213322234010041 |
6 | 223154530552454141 |
7 | 11435343550053106 |
oct | 1125404274703555 |
9 | 171340230313737 |
10 | 41060473735021 |
11 | 120a0715a85174 |
12 | 47319656aa351 |
13 | 19baca84aa660 |
14 | a1d4a22913ad |
15 | 4b31255b1cd1 |
hex | 255822f3876d |
41060473735021 has 64 divisors (see below), whose sum is σ = 47161870479360. Its totient is φ = 35536264181760.
The previous prime is 41060473734947. The next prime is 41060473735091. The reversal of 41060473735021 is 12053737406014.
41060473735021 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 41060473735021 - 229 = 41059936864109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41060473735091) 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 63 ways as a sum of consecutive naturals, for example, 27724829601 + ... + 27724831081.
It is an arithmetic number, because the mean of its divisors is an integer number (736904226240).
Almost surely, 241060473735021 is an apocalyptic number.
It is an amenable number.
41060473735021 is a deficient number, since it is larger than the sum of its proper divisors (6101396744339).
41060473735021 is a wasteful number, since it uses less digits than its factorization.
41060473735021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2911 (or 2877 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 43.
The spelling of 41060473735021 in words is "forty-one trillion, sixty billion, four hundred seventy-three million, seven hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •