Base | Representation |
---|---|
bin | 10010101010011001001101… |
… | …00101001110100111101110 |
3 | 12101022021222122021012120000 |
4 | 21111030212211032213232 |
5 | 20334340443302303302 |
6 | 223141030034005130 |
7 | 11433655105503156 |
oct | 1125144645164756 |
9 | 171267878235500 |
10 | 41039059806702 |
11 | 12092627413951 |
12 | 472978a1167a6 |
13 | 19b8c74bb8659 |
14 | a1c4302ad766 |
15 | 4b27c064e31c |
hex | 25532694e9ee |
41039059806702 has 40 divisors (see below), whose sum is σ = 91964581737600. Its totient is φ = 13678691623776.
The previous prime is 41039059806671. The next prime is 41039059806709. The reversal of 41039059806702 is 20760895093014.
41039059806702 is a `hidden beast` number, since 4 + 10 + 39 + 0 + 598 + 0 + 6 + 7 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41039059806709) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6976927 + ... + 11434842.
It is an arithmetic number, because the mean of its divisors is an integer number (2299114543440).
It is a 1-persistent number, because it is pandigital, but 2⋅41039059806702 = 82078119613404 is not.
Almost surely, 241039059806702 is an apocalyptic number.
41039059806702 is an abundant number, since it is smaller than the sum of its proper divisors (50925521930898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41039059806702 is a wasteful number, since it uses less digits than its factorization.
41039059806702 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18425542 (or 18425533 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 41039059806702 in words is "forty-one trillion, thirty-nine billion, fifty-nine million, eight hundred six thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •