Base | Representation |
---|---|
bin | 1100000010001100110… |
… | …01100111001010100101 |
3 | 1110112022101101202222121 |
4 | 12001012121213022211 |
5 | 23233320440321212 |
6 | 513543000425541 |
7 | 41605602556045 |
oct | 6010631471245 |
9 | 1415271352877 |
10 | 413497979557 |
11 | 14a3aa914203 |
12 | 6817b7782b1 |
13 | 2ccb9c385b0 |
14 | 16028b19725 |
15 | ab51914d07 |
hex | 60466672a5 |
413497979557 has 8 divisors (see below), whose sum is σ = 447250085240. Its totient is φ = 380023669440.
The previous prime is 413497979539. The next prime is 413497979611. The reversal of 413497979557 is 755979794314.
It can be written as a sum of positive squares in 4 ways, for example, as 29334783076 + 384163196481 = 171274^2 + 619809^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 413497979557 - 27 = 413497979429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413497979857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69445794 + ... + 69451747.
It is an arithmetic number, because the mean of its divisors is an integer number (55906260655).
Almost surely, 2413497979557 is an apocalyptic number.
It is an amenable number.
413497979557 is a deficient number, since it is larger than the sum of its proper divisors (33752105683).
413497979557 is a wasteful number, since it uses less digits than its factorization.
413497979557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138897783.
The product of its digits is 300056400, while the sum is 70.
The spelling of 413497979557 in words is "four hundred thirteen billion, four hundred ninety-seven million, nine hundred seventy-nine thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •