Base | Representation |
---|---|
bin | 11000101011001… |
… | …001001011010001 |
3 | 1001211221111102112 |
4 | 120223021023101 |
5 | 1321433303321 |
6 | 105024355105 |
7 | 13154425046 |
oct | 3053111321 |
9 | 1054844375 |
10 | 413962961 |
11 | 1a2742555 |
12 | b6775a95 |
13 | 679bcbc9 |
14 | 3cd9b1cd |
15 | 26520a5b |
hex | 18ac92d1 |
413962961 has 4 divisors (see below), whose sum is σ = 414088500. Its totient is φ = 413837424.
The previous prime is 413962951. The next prime is 413962979. The reversal of 413962961 is 169269314.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 169269314 = 2 ⋅84634657.
It can be written as a sum of positive squares in 2 ways, for example, as 313962961 + 100000000 = 17719^2 + 10000^2 .
It is a cyclic number.
It is not a de Polignac number, because 413962961 - 210 = 413961937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413962931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57686 + ... + 64463.
It is an arithmetic number, because the mean of its divisors is an integer number (103522125).
Almost surely, 2413962961 is an apocalyptic number.
It is an amenable number.
413962961 is a deficient number, since it is larger than the sum of its proper divisors (125539).
413962961 is a wasteful number, since it uses less digits than its factorization.
413962961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125538.
The product of its digits is 69984, while the sum is 41.
The square root of 413962961 is about 20346.0797452482. The cubic root of 413962961 is about 745.2817642080.
The spelling of 413962961 in words is "four hundred thirteen million, nine hundred sixty-two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •