Base | Representation |
---|---|
bin | 10110010001001101100… |
… | …001110110011010101001 |
3 | 12102021222212111202112222 |
4 | 112101031201312122221 |
5 | 200033033110423044 |
6 | 3131003030243425 |
7 | 215363325346343 |
oct | 26211541663251 |
9 | 5367885452488 |
10 | 1530309076649 |
11 | 540000640271 |
12 | 2087014b6575 |
13 | b13cc8369a2 |
14 | 540d2b6c293 |
15 | 29c181c68ee |
hex | 1644d8766a9 |
1530309076649 has 4 divisors (see below), whose sum is σ = 1530520540164. Its totient is φ = 1530097613136.
The previous prime is 1530309076633. The next prime is 1530309076741. The reversal of 1530309076649 is 9466709030351.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1225599556624 + 304709520025 = 1107068^2 + 552005^2 .
It is a cyclic number.
It is not a de Polignac number, because 1530309076649 - 24 = 1530309076633 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1530309076649.
It is not an unprimeable number, because it can be changed into a prime (1530309076619) 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, 105720902 + ... + 105735375.
It is an arithmetic number, because the mean of its divisors is an integer number (382630135041).
Almost surely, 21530309076649 is an apocalyptic number.
It is an amenable number.
1530309076649 is a deficient number, since it is larger than the sum of its proper divisors (211463515).
1530309076649 is an equidigital number, since it uses as much as digits as its factorization.
1530309076649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211463514.
The product of its (nonzero) digits is 3674160, while the sum is 53.
The spelling of 1530309076649 in words is "one trillion, five hundred thirty billion, three hundred nine million, seventy-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •