Base | Representation |
---|---|
bin | 10010110111000101010100… |
… | …00011000100111111010110 |
3 | 12102211222101001011202201220 |
4 | 21123202222003010333112 |
5 | 20414011404112100031 |
6 | 224113213410031210 |
7 | 11510321402640561 |
oct | 1133425203047726 |
9 | 172758331152656 |
10 | 41475057143766 |
11 | 12240522561394 |
12 | 479a188878506 |
13 | 1a1b10926472c |
14 | a355911d54d8 |
15 | 4bdcdc430596 |
hex | 25b8aa0c4fd6 |
41475057143766 has 16 divisors (see below), whose sum is σ = 83312341863600. Its totient is φ = 13764647785248.
The previous prime is 41475057143761. The next prime is 41475057143783. The reversal of 41475057143766 is 66734175057414.
41475057143766 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41475057143761) 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 7 ways as a sum of consecutive naturals, for example, 15092814181 + ... + 15092816928.
It is an arithmetic number, because the mean of its divisors is an integer number (5207021366475).
Almost surely, 241475057143766 is an apocalyptic number.
41475057143766 is an abundant number, since it is smaller than the sum of its proper divisors (41837284719834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41475057143766 is a wasteful number, since it uses less digits than its factorization.
41475057143766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30185631343.
The product of its (nonzero) digits is 59270400, while the sum is 60.
The spelling of 41475057143766 in words is "forty-one trillion, four hundred seventy-five billion, fifty-seven million, one hundred forty-three thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •