Base | Representation |
---|---|
bin | 10010110101101001010011… |
… | …11001111001101000011101 |
3 | 12102200020212122122200012012 |
4 | 21122310221321321220131 |
5 | 20412204224112122140 |
6 | 224034404153521005 |
7 | 11503622352236363 |
oct | 1132645171715035 |
9 | 172606778580165 |
10 | 41425662614045 |
11 | 122215856430a6 |
12 | 47906a2713165 |
13 | 1a16566a87458 |
14 | a33027073633 |
15 | 4bc89acd9265 |
hex | 25ad29e79a1d |
41425662614045 has 4 divisors (see below), whose sum is σ = 49710795136860. Its totient is φ = 33140530091232.
The previous prime is 41425662614029. The next prime is 41425662614053. The reversal of 41425662614045 is 54041626652414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21313568022244 + 20112094591801 = 4616662^2 + 4484651^2 .
It is a cyclic number.
It is not a de Polignac number, because 41425662614045 - 24 = 41425662614029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41425662613984 and 41425662614002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4142566261400 + ... + 4142566261409.
It is an arithmetic number, because the mean of its divisors is an integer number (12427698784215).
Almost surely, 241425662614045 is an apocalyptic number.
It is an amenable number.
41425662614045 is a deficient number, since it is larger than the sum of its proper divisors (8285132522815).
41425662614045 is an equidigital number, since it uses as much as digits as its factorization.
41425662614045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8285132522814.
The product of its (nonzero) digits is 5529600, while the sum is 50.
The spelling of 41425662614045 in words is "forty-one trillion, four hundred twenty-five billion, six hundred sixty-two million, six hundred fourteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •