Base | Representation |
---|---|
bin | 10101010011101010111… |
… | …011101000110100001101 |
3 | 12011222102201210022112210 |
4 | 111103222323220310031 |
5 | 142442220434222421 |
6 | 3040354054421033 |
7 | 210533664620331 |
oct | 25235273506415 |
9 | 5158381708483 |
10 | 1464230382861 |
11 | 514a81973634 |
12 | 1b793b961779 |
13 | a80cb91a08c |
14 | 50c24c637c1 |
15 | 2814be94576 |
hex | 154eaee8d0d |
1464230382861 has 8 divisors (see below), whose sum is σ = 1952316801504. Its totient is φ = 976148776400.
The previous prime is 1464230382833. The next prime is 1464230382871. The reversal of 1464230382861 is 1682830324641.
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 1464230382861 - 214 = 1464230366477 is a prime.
It is a super-2 number, since 2×14642303828612 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1464230382861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1464230382821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 420315 + ... + 1762136.
It is an arithmetic number, because the mean of its divisors is an integer number (244039600188).
Almost surely, 21464230382861 is an apocalyptic number.
It is an amenable number.
1464230382861 is a deficient number, since it is larger than the sum of its proper divisors (488086418643).
1464230382861 is a wasteful number, since it uses less digits than its factorization.
1464230382861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2406091.
The product of its (nonzero) digits is 1327104, while the sum is 48.
The spelling of 1464230382861 in words is "one trillion, four hundred sixty-four billion, two hundred thirty million, three hundred eighty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •