Base | Representation |
---|---|
bin | 1011111011100001100… |
… | …11111010011100100011 |
3 | 1110012001122112200211021 |
4 | 11331300303322130203 |
5 | 23204001111100201 |
6 | 512151231230311 |
7 | 41421031120516 |
oct | 5756063723443 |
9 | 1405048480737 |
10 | 409914550051 |
11 | 148931093616 |
12 | 6753b678397 |
13 | 2c86870a8c6 |
14 | 15ba8c40d7d |
15 | a9e2027ea1 |
hex | 5f70cfa723 |
409914550051 has 8 divisors (see below), whose sum is σ = 423319258544. Its totient is φ = 396632259360.
The previous prime is 409914549991. The next prime is 409914550061. The reversal of 409914550051 is 150055419904.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-409914550051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (409914550061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30597645 + ... + 30611038.
It is an arithmetic number, because the mean of its divisors is an integer number (52914907318).
Almost surely, 2409914550051 is an apocalyptic number.
409914550051 is a deficient number, since it is larger than the sum of its proper divisors (13404708493).
409914550051 is a wasteful number, since it uses less digits than its factorization.
409914550051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61208901.
The product of its (nonzero) digits is 162000, while the sum is 43.
Adding to 409914550051 its reverse (150055419904), we get a palindrome (559969969955).
The spelling of 409914550051 in words is "four hundred nine billion, nine hundred fourteen million, five hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •