Base | Representation |
---|---|
bin | 101001010001110… |
… | …0110001011100001 |
3 | 10120112020111102201 |
4 | 1102203212023201 |
5 | 10314034010022 |
6 | 345234413201 |
7 | 46215561643 |
oct | 12243461341 |
9 | 3515214381 |
10 | 1385063137 |
11 | 650917487 |
12 | 327a31201 |
13 | 190c4bab3 |
14 | d1d44893 |
15 | 818e4127 |
hex | 528e62e1 |
1385063137 has 4 divisors (see below), whose sum is σ = 1395027760. Its totient is φ = 1375098516.
The previous prime is 1385063089. The next prime is 1385063161. The reversal of 1385063137 is 7313605831.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1385063137 - 219 = 1384538849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1385063096 and 1385063105.
It is not an unprimeable number, because it can be changed into a prime (1385063177) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4982103 + ... + 4982380.
It is an arithmetic number, because the mean of its divisors is an integer number (348756940).
Almost surely, 21385063137 is an apocalyptic number.
It is an amenable number.
1385063137 is a deficient number, since it is larger than the sum of its proper divisors (9964623).
1385063137 is an equidigital number, since it uses as much as digits as its factorization.
1385063137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9964622.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 1385063137 is about 37216.4363823298. The cubic root of 1385063137 is about 1114.6962076639.
Adding to 1385063137 its reverse (7313605831), we get a palindrome (8698668968).
The spelling of 1385063137 in words is "one billion, three hundred eighty-five million, sixty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •