Base | Representation |
---|---|
bin | 1111001001011011000000… |
… | …1111010001110010110101 |
3 | 2011222011021212200001000020 |
4 | 3302112300033101302311 |
5 | 4140332002010023103 |
6 | 55230554203035353 |
7 | 3336152102516106 |
oct | 362266017216265 |
9 | 64864255601006 |
10 | 16654545001653 |
11 | 534117551a029 |
12 | 1a4b91950bb59 |
13 | 93a6946b7310 |
14 | 4181273943ad |
15 | 1dd35261a753 |
hex | f25b03d1cb5 |
16654545001653 has 64 divisors (see below), whose sum is σ = 25212893798400. Its totient is φ = 9694104675840.
The previous prime is 16654545001651. The next prime is 16654545001667. The reversal of 16654545001653 is 35610054545661.
It is not a de Polignac number, because 16654545001653 - 21 = 16654545001651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16654545001596 and 16654545001605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16654545001651) 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 63 ways as a sum of consecutive naturals, for example, 1296975513 + ... + 1296988353.
It is an arithmetic number, because the mean of its divisors is an integer number (393951465600).
Almost surely, 216654545001653 is an apocalyptic number.
16654545001653 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16654545001653 is a deficient number, since it is larger than the sum of its proper divisors (8558348796747).
16654545001653 is a wasteful number, since it uses less digits than its factorization.
16654545001653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15522.
The product of its (nonzero) digits is 6480000, while the sum is 51.
The spelling of 16654545001653 in words is "sixteen trillion, six hundred fifty-four billion, five hundred forty-five million, one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •