Base | Representation |
---|---|
bin | 10010110101011010001101… |
… | …00110110100011011100010 |
3 | 12102122110221120021102001110 |
4 | 21122231012212310123202 |
5 | 20412041122334413144 |
6 | 224030543422444150 |
7 | 11503214414061036 |
oct | 1132550646643342 |
9 | 172573846242043 |
10 | 41417554216674 |
11 | 122190a4669149 |
12 | 478abbb133656 |
13 | 1a15873c5059c |
14 | a328982301c6 |
15 | 4bc57402b0b9 |
hex | 25ab469b46e2 |
41417554216674 has 48 divisors (see below), whose sum is σ = 84225811793760. Its totient is φ = 13577834620800.
The previous prime is 41417554216537. The next prime is 41417554216691. The reversal of 41417554216674 is 47661245571414.
It is a happy number.
41417554216674 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×414175542166742 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
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, 185841889 + ... + 186064619.
It is an arithmetic number, because the mean of its divisors is an integer number (1754704412370).
Almost surely, 241417554216674 is an apocalyptic number.
41417554216674 is an abundant number, since it is smaller than the sum of its proper divisors (42808257577086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41417554216674 is a wasteful number, since it uses less digits than its factorization.
41417554216674 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231187 (or 231126 counting only the distinct ones).
The product of its digits is 22579200, while the sum is 57.
The spelling of 41417554216674 in words is "forty-one trillion, four hundred seventeen billion, five hundred fifty-four million, two hundred sixteen thousand, six hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •