Base | Representation |
---|---|
bin | 100110010101100011… |
… | …111111100101010001 |
3 | 10221020210020010200111 |
4 | 212111203333211101 |
5 | 1133300432240241 |
6 | 30524354121321 |
7 | 2655036525211 |
oct | 462543774521 |
9 | 127223203614 |
10 | 41163946321 |
11 | 16503a7a153 |
12 | 7b89880241 |
13 | 3b602624b4 |
14 | 1dc6dd4241 |
15 | 110dc9ec81 |
hex | 9958ff951 |
41163946321 has 3 divisors (see below), whose sum is σ = 41164149211. Its totient is φ = 41163743432.
The previous prime is 41163946309. The next prime is 41163946379. The reversal of 41163946321 is 12364936114.
The square root of 41163946321 is 202889.
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., 3651921 + 41160294400 = 1911^2 + 202880^2 .
It is not a de Polignac number, because 41163946321 - 25 = 41163946289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41163946301) 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, 101445 + ... + 304333.
Almost surely, 241163946321 is an apocalyptic number.
41163946321 is the 202889-th square number.
41163946321 is the 101445-th centered octagonal number.
It is an amenable number.
41163946321 is a deficient number, since it is larger than the sum of its proper divisors (202890).
41163946321 is an frugal number, since it uses more digits than its factorization.
41163946321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405778 (or 202889 counting only the distinct ones).
The product of its digits is 93312, while the sum is 40.
The spelling of 41163946321 in words is "forty-one billion, one hundred sixty-three million, nine hundred forty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •