Base | Representation |
---|---|
bin | 100111000011101101… |
… | …001000101010011101 |
3 | 11000020201220221200111 |
4 | 213003231020222131 |
5 | 1141342123012444 |
6 | 31133250530021 |
7 | 3013156631545 |
oct | 470355105235 |
9 | 130221827614 |
10 | 41938094749 |
11 | 16870a63341 |
12 | 8164b96911 |
13 | 3c547636a5 |
14 | 205bb50325 |
15 | 1156c1c234 |
hex | 9c3b48a9d |
41938094749 has 2 divisors, whose sum is σ = 41938094750. Its totient is φ = 41938094748.
The previous prime is 41938094743. The next prime is 41938094791. The reversal of 41938094749 is 94749083914.
41938094749 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26640115524 + 15297979225 = 163218^2 + 123685^2 .
It is a cyclic number.
It is not a de Polignac number, because 41938094749 - 211 = 41938092701 is a prime.
It is a super-2 number, since 2×419380947492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41938094693 and 41938094702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41938094743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20969047374 + 20969047375.
It is an arithmetic number, because the mean of its divisors is an integer number (20969047375).
Almost surely, 241938094749 is an apocalyptic number.
It is an amenable number.
41938094749 is a deficient number, since it is larger than the sum of its proper divisors (1).
41938094749 is an equidigital number, since it uses as much as digits as its factorization.
41938094749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7838208, while the sum is 58.
The spelling of 41938094749 in words is "forty-one billion, nine hundred thirty-eight million, ninety-four thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •