Base | Representation |
---|---|
bin | 1100000000101001110… |
… | …01100000111001000000 |
3 | 1110110011111200010001101 |
4 | 12000110321200321000 |
5 | 23230120333403124 |
6 | 513324332144144 |
7 | 41546166501304 |
oct | 6002471407100 |
9 | 1413144603041 |
10 | 412667481664 |
11 | 14a014042909 |
12 | 67b89608054 |
13 | 2cbb6b67c19 |
14 | 15d8a6d1d04 |
15 | ab03a66644 |
hex | 6014e60e40 |
412667481664 has 63 divisors (see below), whose sum is σ = 833614220881. Its totient is φ = 202687523840.
The previous prime is 412667481659. The next prime is 412667481701. The reversal of 412667481664 is 466184766214.
The square root of 412667481664 is 642392.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 70114803264 + 342552678400 = 264792^2 + 585280^2 .
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 303208344 + ... + 303209704.
Almost surely, 2412667481664 is an apocalyptic number.
412667481664 is the 642392-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 412667481664
412667481664 is an abundant number, since it is smaller than the sum of its proper divisors (420946739217).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
412667481664 is an frugal number, since it uses more digits than its factorization.
412667481664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852 (or 1422 counting only the distinct ones).
The product of its digits is 9289728, while the sum is 55.
The spelling of 412667481664 in words is "four hundred twelve billion, six hundred sixty-seven million, four hundred eighty-one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •