Base | Representation |
---|---|
bin | 1100000001110110110… |
… | …00100001010011001011 |
3 | 1110111211111121011021122 |
4 | 12000323120201103023 |
5 | 23232431131102021 |
6 | 513512355025455 |
7 | 41601166520645 |
oct | 6007330412313 |
9 | 1414744534248 |
10 | 413313144011 |
11 | 14a315549559 |
12 | 6812989b28b |
13 | 2cc8a860751 |
14 | 1600c363895 |
15 | ab405a3bab |
hex | 603b6214cb |
413313144011 has 8 divisors (see below), whose sum is σ = 460658612880. Its totient is φ = 368526889728.
The previous prime is 413313143987. The next prime is 413313144019. The reversal of 413313144011 is 110441313314.
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 413313144011 - 222 = 413308949707 is a prime.
It is a super-3 number, since 3×4133131440113 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413313144019) 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, 639803306 + ... + 639803951.
It is an arithmetic number, because the mean of its divisors is an integer number (57582326610).
Almost surely, 2413313144011 is an apocalyptic number.
413313144011 is a deficient number, since it is larger than the sum of its proper divisors (47345468869).
413313144011 is a wasteful number, since it uses less digits than its factorization.
413313144011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279607293.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 413313144011 its reverse (110441313314), we get a palindrome (523754457325).
The spelling of 413313144011 in words is "four hundred thirteen billion, three hundred thirteen million, one hundred forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •