Base | Representation |
---|---|
bin | 100110001100100101… |
… | …111001011010010101 |
3 | 10220212022001011002002 |
4 | 212030211321122111 |
5 | 1132443420403024 |
6 | 30501420325045 |
7 | 2651231401442 |
oct | 461445713225 |
9 | 126768034062 |
10 | 41013450389 |
11 | 1643702934a |
12 | 7b473a3785 |
13 | 3b3801b952 |
14 | 1db101a9c9 |
15 | 11009736ae |
hex | 98c979695 |
41013450389 has 2 divisors, whose sum is σ = 41013450390. Its totient is φ = 41013450388.
The previous prime is 41013450371. The next prime is 41013450391. The reversal of 41013450389 is 98305431014.
41013450389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38825549764 + 2187900625 = 197042^2 + 46775^2 .
It is a cyclic number.
It is not a de Polignac number, because 41013450389 - 28 = 41013450133 is a prime.
It is a super-2 number, since 2×410134503892 (a number of 22 digits) contains 22 as substring.
Together with 41013450391, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41013450349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20506725194 + 20506725195.
It is an arithmetic number, because the mean of its divisors is an integer number (20506725195).
Almost surely, 241013450389 is an apocalyptic number.
It is an amenable number.
41013450389 is a deficient number, since it is larger than the sum of its proper divisors (1).
41013450389 is an equidigital number, since it uses as much as digits as its factorization.
41013450389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 41013450389 in words is "forty-one billion, thirteen million, four hundred fifty thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •