Base | Representation |
---|---|
bin | 11000100110000… |
… | …110110001001101 |
3 | 1001202110101221011 |
4 | 120212012301031 |
5 | 1321114024011 |
6 | 104540205221 |
7 | 13140255004 |
oct | 3046066115 |
9 | 1052411834 |
10 | 412642381 |
11 | 1a1a20368 |
12 | b6239811 |
13 | 67649ab8 |
14 | 3cb35c3b |
15 | 2635e621 |
hex | 18986c4d |
412642381 has 8 divisors (see below), whose sum is σ = 415882944. Its totient is φ = 409408800.
The previous prime is 412642367. The next prime is 412642403. The reversal of 412642381 is 183246214.
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-412642381 is a prime.
It is a super-2 number, since 2×4126423812 = 340547469194698322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412645381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215430 + ... + 217336.
It is an arithmetic number, because the mean of its divisors is an integer number (51985368).
Almost surely, 2412642381 is an apocalyptic number.
It is an amenable number.
412642381 is a deficient number, since it is larger than the sum of its proper divisors (3240563).
412642381 is a wasteful number, since it uses less digits than its factorization.
412642381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3491.
The product of its digits is 9216, while the sum is 31.
The square root of 412642381 is about 20313.6008870904. The cubic root of 412642381 is about 744.4884141492.
Adding to 412642381 its reverse (183246214), we get a palindrome (595888595).
The spelling of 412642381 in words is "four hundred twelve million, six hundred forty-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •