Base | Representation |
---|---|
bin | 10101010010100101100… |
… | …000011001001110011101 |
3 | 12011212102120001212222012 |
4 | 111102211200121032131 |
5 | 142432324244110323 |
6 | 3040042325401005 |
7 | 210463062343421 |
oct | 25224540311635 |
9 | 5155376055865 |
10 | 1463065613213 |
11 | 51453443a996 |
12 | 1b7675869165 |
13 | a7c7450c479 |
14 | 50b542a4b81 |
15 | 280ceab7678 |
hex | 154a581939d |
1463065613213 has 12 divisors (see below), whose sum is σ = 1546641072828. Its totient is φ = 1383800837760.
The previous prime is 1463065613179. The next prime is 1463065613249. The reversal of 1463065613213 is 3123165603641.
It can be written as a sum of positive squares in 2 ways, for example, as 395443518649 + 1067622094564 = 628843^2 + 1033258^2 .
It is not a de Polignac number, because 1463065613213 - 226 = 1462998504349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1463065603213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3084428 + ... + 3527013.
It is an arithmetic number, because the mean of its divisors is an integer number (128886756069).
Almost surely, 21463065613213 is an apocalyptic number.
It is an amenable number.
1463065613213 is a deficient number, since it is larger than the sum of its proper divisors (83575459615).
1463065613213 is an equidigital number, since it uses as much as digits as its factorization.
1463065613213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6612092 (or 6612073 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 1463065613213 in words is "one trillion, four hundred sixty-three billion, sixty-five million, six hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •