Base | Representation |
---|---|
bin | 1111000010001011010011… |
… | …1101110000000011111101 |
3 | 2011112021000000110001121111 |
4 | 3300202310331300003331 |
5 | 4131312040440212113 |
6 | 55053450501002021 |
7 | 3324154356514612 |
oct | 360426475600375 |
9 | 64467000401544 |
10 | 16530070241533 |
11 | 52a33aa793452 |
12 | 1a2b77b0b3311 |
13 | 92ba184228c4 |
14 | 4120b9a32509 |
15 | 1d9eb98b013d |
hex | f08b4f700fd |
16530070241533 has 4 divisors (see below), whose sum is σ = 16533737889760. Its totient is φ = 16526402593308.
The previous prime is 16530070241513. The next prime is 16530070241551. The reversal of 16530070241533 is 33514207003561.
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 16530070241533 - 233 = 16521480306941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16530070241513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1833817353 + ... + 1833826366.
It is an arithmetic number, because the mean of its divisors is an integer number (4133434472440).
Almost surely, 216530070241533 is an apocalyptic number.
It is an amenable number.
16530070241533 is a deficient number, since it is larger than the sum of its proper divisors (3667648227).
16530070241533 is an equidigital number, since it uses as much as digits as its factorization.
16530070241533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3667648226.
The product of its (nonzero) digits is 226800, while the sum is 40.
The spelling of 16530070241533 in words is "sixteen trillion, five hundred thirty billion, seventy million, two hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •