Base | Representation |
---|---|
bin | 10100001010000110000… |
… | …000000011111001110111 |
3 | 11220102111220011202112021 |
4 | 110022012000003321313 |
5 | 140143421233212442 |
6 | 2540210443334011 |
7 | 202036142412334 |
oct | 24120600037167 |
9 | 4812456152467 |
10 | 1385227632247 |
11 | 4945209817a8 |
12 | 1a4571b21307 |
13 | a081b29b474 |
14 | 4b08c71b98b |
15 | 26076311e67 |
hex | 14286003e77 |
1385227632247 has 4 divisors (see below), whose sum is σ = 1393522408656. Its totient is φ = 1376932855840.
The previous prime is 1385227632193. The next prime is 1385227632277. The reversal of 1385227632247 is 7422367225831.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1385227632247 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1385227632194 and 1385227632203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1385227632277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4147387954 + ... + 4147388287.
It is an arithmetic number, because the mean of its divisors is an integer number (348380602164).
Almost surely, 21385227632247 is an apocalyptic number.
1385227632247 is a deficient number, since it is larger than the sum of its proper divisors (8294776409).
1385227632247 is an equidigital number, since it uses as much as digits as its factorization.
1385227632247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8294776408.
The product of its digits is 6773760, while the sum is 52.
The spelling of 1385227632247 in words is "one trillion, three hundred eighty-five billion, two hundred twenty-seven million, six hundred thirty-two thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •