Base | Representation |
---|---|
bin | 100111000110110110… |
… | …110111010101111001 |
3 | 11000101102102122100021 |
4 | 213012312313111321 |
5 | 1141444142230024 |
6 | 31142420210441 |
7 | 3014401262101 |
oct | 470666672571 |
9 | 130342378307 |
10 | 41990976889 |
11 | 168988a2494 |
12 | 817a839a21 |
13 | 3c626ba8b4 |
14 | 2064b98201 |
15 | 115b6b5de4 |
hex | 9c6db7579 |
41990976889 has 3 divisors (see below), whose sum is σ = 41991181807. Its totient is φ = 41990771972.
The previous prime is 41990976869. The next prime is 41990976917. The reversal of 41990976889 is 98867909914.
The square root of 41990976889 is 204917.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 16807826025 + 25183150864 = 129645^2 + 158692^2 .
It is not a de Polignac number, because 41990976889 - 223 = 41982588281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41990976829) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 102459 + ... + 307375.
Almost surely, 241990976889 is an apocalyptic number.
41990976889 is the 204917-th square number.
41990976889 is the 102459-th centered octagonal number.
It is an amenable number.
41990976889 is a deficient number, since it is larger than the sum of its proper divisors (204918).
41990976889 is an frugal number, since it uses more digits than its factorization.
41990976889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 409834 (or 204917 counting only the distinct ones).
The product of its (nonzero) digits is 70543872, while the sum is 70.
The spelling of 41990976889 in words is "forty-one billion, nine hundred ninety million, nine hundred seventy-six thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •