Base | Representation |
---|---|
bin | 101110110101110110000000… |
… | …0111111110011110110001011 |
3 | 2000000211202222202121202202122 |
4 | 1131223230000333303312023 |
5 | 413001021013221300021 |
6 | 4020143341010121455 |
7 | 152533333455321632 |
oct | 13553540077636613 |
9 | 2000752882552678 |
10 | 412020524400011 |
11 | 10a311a17741a5a |
12 | 3a264407b8028b |
13 | 148b94a4161417 |
14 | 73a5c85016519 |
15 | 32978ecd52bab |
hex | 176bb00ff3d8b |
412020524400011 has 4 divisors (see below), whose sum is σ = 412040614162800. Its totient is φ = 412000434637224.
The previous prime is 412020524399987. The next prime is 412020524400071. The reversal of 412020524400011 is 110004425020214.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 412020524400011 - 226 = 412020457291147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (412020524400071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10044850631 + ... + 10044891648.
It is an arithmetic number, because the mean of its divisors is an integer number (103010153540700).
Almost surely, 2412020524400011 is an apocalyptic number.
412020524400011 is a deficient number, since it is larger than the sum of its proper divisors (20089762789).
412020524400011 is a wasteful number, since it uses less digits than its factorization.
412020524400011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20089762788.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 412020524400011 its reverse (110004425020214), we get a palindrome (522024949420225).
The spelling of 412020524400011 in words is "four hundred twelve trillion, twenty billion, five hundred twenty-four million, four hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •