Base | Representation |
---|---|
bin | 1111000010011000100101… |
… | …0011101000110001101001 |
3 | 2011112121012021221011122111 |
4 | 3300212021103220301221 |
5 | 4131341334440424044 |
6 | 55055240201522321 |
7 | 3324341555363002 |
oct | 360461123506151 |
9 | 64477167834574 |
10 | 16533632748649 |
11 | 52a4968723805 |
12 | 1a303b41a33a1 |
13 | 92c165506393 |
14 | 412336c221a9 |
15 | 1da127517b34 |
hex | f09894e8c69 |
16533632748649 has 9 divisors (see below), whose sum is σ = 16553242644861. Its totient is φ = 16514046070380.
The previous prime is 16533632748583. The next prime is 16533632748673. The reversal of 16533632748649 is 94684723633561.
It is a happy number.
The square root of 16533632748649 is 4066157.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 16533632748649 - 229 = 16533095877737 is a prime.
It is a super-2 number, since 2×165336327486492 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16533632748449) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4436175424 + ... + 4436179150.
Almost surely, 216533632748649 is an apocalyptic number.
16533632748649 is the 4066157-th square number.
16533632748649 is the 2033079-th centered octagonal number.
It is an amenable number.
16533632748649 is a deficient number, since it is larger than the sum of its proper divisors (19609896212).
16533632748649 is an frugal number, since it uses more digits than its factorization.
16533632748649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9636 (or 4818 counting only the distinct ones).
The product of its digits is 470292480, while the sum is 67.
The spelling of 16533632748649 in words is "sixteen trillion, five hundred thirty-three billion, six hundred thirty-two million, seven hundred forty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •