Base | Representation |
---|---|
bin | 1100000011011000010… |
… | …01010100110011000111 |
3 | 1110120221111222221210210 |
4 | 12001230021110303013 |
5 | 23241120044303411 |
6 | 514125501450503 |
7 | 41630362331535 |
oct | 6015411246307 |
9 | 1416844887723 |
10 | 414131244231 |
11 | 14a6a5322341 |
12 | 68317870a33 |
13 | 3008b1b0113 |
14 | 16088c81155 |
15 | ab8c303ca6 |
hex | 606c254cc7 |
414131244231 has 8 divisors (see below), whose sum is σ = 552209410800. Its totient is φ = 276070286912.
The previous prime is 414131244227. The next prime is 414131244311. The reversal of 414131244231 is 132442131414.
It is a happy number.
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 414131244231 - 22 = 414131244227 is a prime.
It is a super-2 number, since 2×4141312442312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414131244211) 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, 4246056 + ... + 4342493.
It is an arithmetic number, because the mean of its divisors is an integer number (69026176350).
Almost surely, 2414131244231 is an apocalyptic number.
414131244231 is a deficient number, since it is larger than the sum of its proper divisors (138078166569).
414131244231 is a wasteful number, since it uses less digits than its factorization.
414131244231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8604625.
The product of its digits is 9216, while the sum is 30.
Adding to 414131244231 its reverse (132442131414), we get a palindrome (546573375645).
The spelling of 414131244231 in words is "four hundred fourteen billion, one hundred thirty-one million, two hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •