Base | Representation |
---|---|
bin | 101110111000000010111010… |
… | …1101101011010111110100111 |
3 | 2000001220201001212212101202202 |
4 | 1131300011311231122332213 |
5 | 413021000232314141201 |
6 | 4020534344151125115 |
7 | 152564235354354350 |
oct | 13560056555327647 |
9 | 2001821055771682 |
10 | 412323130224551 |
11 | 10a419291851857 |
12 | 3a2b2b9a07379b |
13 | 1490bb9aac2130 |
14 | 73b6790274d27 |
15 | 32a070e192c6b |
hex | 1770175b5afa7 |
412323130224551 has 16 divisors (see below), whose sum is σ = 507568477538304. Its totient is φ = 326173349630304.
The previous prime is 412323130224493. The next prime is 412323130224553. The reversal of 412323130224551 is 155422031323214.
It is a cyclic number.
It is not a de Polignac number, because 412323130224551 - 210 = 412323130223527 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412323130224553) 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 15 ways as a sum of consecutive naturals, for example, 418504025 + ... + 419488098.
It is an arithmetic number, because the mean of its divisors is an integer number (31723029846144).
Almost surely, 2412323130224551 is an apocalyptic number.
412323130224551 is a deficient number, since it is larger than the sum of its proper divisors (95245347313753).
412323130224551 is a wasteful number, since it uses less digits than its factorization.
412323130224551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837997550.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 412323130224551 its reverse (155422031323214), we get a palindrome (567745161547765).
The spelling of 412323130224551 in words is "four hundred twelve trillion, three hundred twenty-three billion, one hundred thirty million, two hundred twenty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •