Base | Representation |
---|---|
bin | 1100000001011110100… |
… | …10000010111100010011 |
3 | 1110111022100120110222122 |
4 | 12000233102002330103 |
5 | 23232022142321321 |
6 | 513440303324455 |
7 | 41563153040555 |
oct | 6005722027423 |
9 | 1414270513878 |
10 | 413110120211 |
11 | 14a220990798 |
12 | 680918b072b |
13 | 2cc57788019 |
14 | 15dcd3d54d5 |
15 | ab2c84d8ab |
hex | 602f482f13 |
413110120211 has 8 divisors (see below), whose sum is σ = 427384012800. Its totient is φ = 398838142080.
The previous prime is 413110120141. The next prime is 413110120249. The reversal of 413110120211 is 112021011314.
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-413110120211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 413110120211.
It is not an unprimeable number, because it can be changed into a prime (413110120811) 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, 32531 + ... + 909548.
It is an arithmetic number, because the mean of its divisors is an integer number (53423001600).
Almost surely, 2413110120211 is an apocalyptic number.
413110120211 is a deficient number, since it is larger than the sum of its proper divisors (14273892589).
413110120211 is a wasteful number, since it uses less digits than its factorization.
413110120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957229.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 413110120211 its reverse (112021011314), we get a palindrome (525131131525).
The spelling of 413110120211 in words is "four hundred thirteen billion, one hundred ten million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •