Base | Representation |
---|---|
bin | 1110111100100000111000… |
… | …0010110001100010100001 |
3 | 2011011221212201121020100001 |
4 | 3233020032002301202201 |
5 | 4123213313300421341 |
6 | 54541040511500001 |
7 | 3314141422305121 |
oct | 357101602614241 |
9 | 64157781536301 |
10 | 16432780482721 |
11 | 52661151a96a9 |
12 | 1a14948b27601 |
13 | 9227b2274195 |
14 | 40b4ca90cc81 |
15 | 1d76c357ed31 |
hex | ef20e0b18a1 |
16432780482721 has 4 divisors (see below), whose sum is σ = 16962870175744. Its totient is φ = 15902690789700.
The previous prime is 16432780482707. The next prime is 16432780482761. The reversal of 16432780482721 is 12728408723461.
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 16432780482721 - 25 = 16432780482689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16432780482761) 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, 265044846465 + ... + 265044846526.
It is an arithmetic number, because the mean of its divisors is an integer number (4240717543936).
Almost surely, 216432780482721 is an apocalyptic number.
It is an amenable number.
16432780482721 is a deficient number, since it is larger than the sum of its proper divisors (530089693023).
16432780482721 is an equidigital number, since it uses as much as digits as its factorization.
16432780482721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530089693022.
The product of its (nonzero) digits is 7225344, while the sum is 55.
The spelling of 16432780482721 in words is "sixteen trillion, four hundred thirty-two billion, seven hundred eighty million, four hundred eighty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •