Base | Representation |
---|---|
bin | 1100000001011110110… |
… | …01101001001110011111 |
3 | 1110111022111022200020202 |
4 | 12000233121221032133 |
5 | 23232023200041111 |
6 | 513440414134115 |
7 | 41563206004613 |
oct | 6005731511637 |
9 | 1414274280222 |
10 | 413112112031 |
11 | 14a222021223 |
12 | 680924b133b |
13 | 2cc58004808 |
14 | 15dcd793343 |
15 | ab2cae3b3b |
hex | 602f66939f |
413112112031 has 8 divisors (see below), whose sum is σ = 418131558000. Its totient is φ = 408110886400.
The previous prime is 413112112027. The next prime is 413112112033. The reversal of 413112112031 is 130211211314.
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 413112112031 - 22 = 413112112027 is a prime.
It is a super-2 number, since 2×4131121120312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 413112111994 and 413112112012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413112112033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4509461 + ... + 4600158.
It is an arithmetic number, because the mean of its divisors is an integer number (52266444750).
Almost surely, 2413112112031 is an apocalyptic number.
413112112031 is a deficient number, since it is larger than the sum of its proper divisors (5019445969).
413112112031 is a wasteful number, since it uses less digits than its factorization.
413112112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9110169.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 413112112031 its reverse (130211211314), we get a palindrome (543323323345).
The spelling of 413112112031 in words is "four hundred thirteen billion, one hundred twelve million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •