Base | Representation |
---|---|
bin | 10010111010111000100100… |
… | …10111000010101000111000 |
3 | 12110022110110201101120011221 |
4 | 21131130102113002220320 |
5 | 20423131340443220420 |
6 | 224253212525401424 |
7 | 11522623642553452 |
oct | 1135342227025070 |
9 | 173273421346157 |
10 | 41605656226360 |
11 | 122909503120a6 |
12 | 47bb556109274 |
13 | 1a2a5202a33b5 |
14 | a3ba200892d2 |
15 | 4c23d2b7ecaa |
hex | 25d7125c2a38 |
41605656226360 has 32 divisors (see below), whose sum is σ = 94539585196800. Its totient is φ = 16477487612800.
The previous prime is 41605656226331. The next prime is 41605656226363. The reversal of 41605656226360 is 6362265650614.
It is a junction number, because it is equal to n+sod(n) for n = 41605656226298 and 41605656226307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41605656226363) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5149210840 + ... + 5149218919.
It is an arithmetic number, because the mean of its divisors is an integer number (2954362037400).
Almost surely, 241605656226360 is an apocalyptic number.
41605656226360 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41605656226360 is an abundant number, since it is smaller than the sum of its proper divisors (52933928970440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41605656226360 is a wasteful number, since it uses less digits than its factorization.
41605656226360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10298429871 (or 10298429867 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 41605656226360 in words is "forty-one trillion, six hundred five billion, six hundred fifty-six million, two hundred twenty-six thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •