Base | Representation |
---|---|
bin | 1100000110001011000… |
… | …10100110001100110011 |
3 | 1110201211001010112122112 |
4 | 12003011202212030303 |
5 | 23302203021310311 |
6 | 514534355355535 |
7 | 42012503363042 |
oct | 6030542461463 |
9 | 1421731115575 |
10 | 415631041331 |
11 | 1502a4984080 |
12 | 68675bb2bab |
13 | 30269b30c1c |
14 | 1618c130559 |
15 | ac28d0d28b |
hex | 60c58a6333 |
415631041331 has 8 divisors (see below), whose sum is σ = 453420750000. Its totient is φ = 377842177440.
The previous prime is 415631041327. The next prime is 415631041349. The reversal of 415631041331 is 133140136514.
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 415631041331 - 22 = 415631041327 is a prime.
It is a super-2 number, since 2×4156310413312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (415631041351) 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, 1268045 + ... + 1561793.
It is an arithmetic number, because the mean of its divisors is an integer number (56677593750).
Almost surely, 2415631041331 is an apocalyptic number.
415631041331 is a deficient number, since it is larger than the sum of its proper divisors (37789708669).
415631041331 is a wasteful number, since it uses less digits than its factorization.
415631041331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422389.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 415631041331 its reverse (133140136514), we get a palindrome (548771177845).
The spelling of 415631041331 in words is "four hundred fifteen billion, six hundred thirty-one million, forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •