Base | Representation |
---|---|
bin | 10011000000101111101101… |
… | …11010100101111001001000 |
3 | 12111000201022211201001201022 |
4 | 21200113312322211321020 |
5 | 20434431324131343124 |
6 | 224525521535212012 |
7 | 11543313621152615 |
oct | 1140276672457110 |
9 | 174021284631638 |
10 | 41807059246664 |
11 | 12359302045208 |
12 | 48325a3677008 |
13 | 1a4350918a9aa |
14 | a4768862750c |
15 | 4c776e393c5e |
hex | 2605f6ea5e48 |
41807059246664 has 16 divisors (see below), whose sum is σ = 78538117999920. Its totient is φ = 20863561113360.
The previous prime is 41807059246661. The next prime is 41807059246709. The reversal of 41807059246664 is 46664295070814.
41807059246664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 41807059246597 and 41807059246606.
It is not an unprimeable number, because it can be changed into a prime (41807059246661) 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 3 ways as a sum of consecutive naturals, for example, 4996059302 + ... + 4996067669.
It is an arithmetic number, because the mean of its divisors is an integer number (4908632374995).
Almost surely, 241807059246664 is an apocalyptic number.
It is an amenable number.
41807059246664 is a deficient number, since it is larger than the sum of its proper divisors (36731058753256).
41807059246664 is a wasteful number, since it uses less digits than its factorization.
41807059246664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9992127500 (or 9992127496 counting only the distinct ones).
The product of its (nonzero) digits is 69672960, while the sum is 62.
The spelling of 41807059246664 in words is "forty-one trillion, eight hundred seven billion, fifty-nine million, two hundred forty-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •