Base | Representation |
---|---|
bin | 10011100111101011… |
… | …00101010100110101 |
3 | 1000012002101011210121 |
4 | 21303311211110311 |
5 | 133033020022244 |
6 | 4501114251541 |
7 | 522012043066 |
oct | 116365452465 |
9 | 30162334717 |
10 | 10533360949 |
11 | 4515897a91 |
12 | 205b726bb1 |
13 | cbb353277 |
14 | 71cd2056d |
15 | 419b15c84 |
hex | 273d65535 |
10533360949 has 4 divisors (see below), whose sum is σ = 10533632940. Its totient is φ = 10533088960.
The previous prime is 10533360931. The next prime is 10533360977. The reversal of 10533360949 is 94906333501.
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 2409042724 + 8124318225 = 49082^2 + 90135^2 .
It is a cyclic number.
It is not a de Polignac number, because 10533360949 - 215 = 10533328181 is a prime.
It is a super-2 number, since 2×105333609492 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10533363949) 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 3 ways as a sum of consecutive naturals, for example, 65842 + ... + 159379.
It is an arithmetic number, because the mean of its divisors is an integer number (2633408235).
Almost surely, 210533360949 is an apocalyptic number.
It is an amenable number.
10533360949 is a deficient number, since it is larger than the sum of its proper divisors (271991).
10533360949 is an equidigital number, since it uses as much as digits as its factorization.
10533360949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271990.
The product of its (nonzero) digits is 262440, while the sum is 43.
The spelling of 10533360949 in words is "ten billion, five hundred thirty-three million, three hundred sixty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •