Base | Representation |
---|---|
bin | 1100000001011110110… |
… | …01100111000011000111 |
3 | 1110111022111022020000101 |
4 | 12000233121213003013 |
5 | 23232023144244421 |
6 | 513440414024531 |
7 | 41563205636611 |
oct | 6005731470307 |
9 | 1414274266011 |
10 | 413112103111 |
11 | 14a222015554 |
12 | 680924a8147 |
13 | 2cc58000736 |
14 | 15dcd78ddb1 |
15 | ab2cae1191 |
hex | 602f6670c7 |
413112103111 has 8 divisors (see below), whose sum is σ = 435210433920. Its totient is φ = 391049331192.
The previous prime is 413112103069. The next prime is 413112103121. The reversal of 413112103111 is 111301211314.
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 413112103111 - 27 = 413112102983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413112103121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8865865 + ... + 8912338.
It is an arithmetic number, because the mean of its divisors is an integer number (54401304240).
Almost surely, 2413112103111 is an apocalyptic number.
413112103111 is a deficient number, since it is larger than the sum of its proper divisors (22098330809).
413112103111 is a wasteful number, since it uses less digits than its factorization.
413112103111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17779445.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 413112103111 its reverse (111301211314), we get a palindrome (524413314425).
The spelling of 413112103111 in words is "four hundred thirteen billion, one hundred twelve million, one hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •