Base | Representation |
---|---|
bin | 10010111001100101110001… |
… | …11001100100010001011101 |
3 | 12110011012201212210120000010 |
4 | 21130302320321210101131 |
5 | 20421414322121421441 |
6 | 224220542043353433 |
7 | 11516461264126032 |
oct | 1134627071442135 |
9 | 173135655716003 |
10 | 41561205654621 |
11 | 122740101036a4 |
12 | 47b2a0b822879 |
13 | 1a26288162443 |
14 | a3980479b389 |
15 | 4c11805c0116 |
hex | 25ccb8e6445d |
41561205654621 has 24 divisors (see below), whose sum is σ = 61964621579680. Its totient is φ = 24705112948992.
The previous prime is 41561205654547. The next prime is 41561205654629. The reversal of 41561205654621 is 12645650216514.
It is a happy number.
41561205654621 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 41561205654621 - 235 = 41526845916253 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41561205654629) 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, 1261478266 + ... + 1261511211.
Almost surely, 241561205654621 is an apocalyptic number.
It is an amenable number.
41561205654621 is a deficient number, since it is larger than the sum of its proper divisors (20403415925059).
41561205654621 is a wasteful number, since it uses less digits than its factorization.
41561205654621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2522989533 (or 2522989516 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 41561205654621 in words is "forty-one trillion, five hundred sixty-one billion, two hundred five million, six hundred fifty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •