Base | Representation |
---|---|
bin | 1111001000111000101100… |
… | …1011101000100010100101 |
3 | 2011221021111220022212220102 |
4 | 3302032023023220202211 |
5 | 4140204120314322121 |
6 | 55222432141313445 |
7 | 3335404610021324 |
oct | 362161313504245 |
9 | 64837456285812 |
10 | 16645333354661 |
11 | 5338278810330 |
12 | 1a49b88565885 |
13 | 93985713261b |
14 | 4178d1c080bb |
15 | 1dceb3a8390b |
hex | f238b2e88a5 |
16645333354661 has 16 divisors (see below), whose sum is σ = 18415153087488. Its totient is φ = 14919683788800.
The previous prime is 16645333354649. The next prime is 16645333354721.
16645333354661 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16645333354661 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16645333354597 and 16645333354606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16645333354631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34818236 + ... + 35293061.
It is an arithmetic number, because the mean of its divisors is an integer number (1150947067968).
Almost surely, 216645333354661 is an apocalyptic number.
16645333354661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16645333354661 is a deficient number, since it is larger than the sum of its proper divisors (1769819732827).
16645333354661 is a wasteful number, since it uses less digits than its factorization.
16645333354661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70111612.
The product of its digits is 41990400, while the sum is 56.
The spelling of 16645333354661 in words is "sixteen trillion, six hundred forty-five billion, three hundred thirty-three million, three hundred fifty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •