Base | Representation |
---|---|
bin | 1111000011011010111110… |
… | …0011010011110110100001 |
3 | 2011121022012022020210011012 |
4 | 3300312233203103312201 |
5 | 4132134334242320031 |
6 | 55111344430430305 |
7 | 3325542315624626 |
oct | 360665743236641 |
9 | 64538168223135 |
10 | 16551454260641 |
11 | 5301483486513 |
12 | 1a33948662395 |
13 | 930a45772051 |
14 | 413147a6a34d |
15 | 1da81bdb5b2b |
hex | f0daf8d3da1 |
16551454260641 has 2 divisors, whose sum is σ = 16551454260642. Its totient is φ = 16551454260640.
The previous prime is 16551454260631. The next prime is 16551454260701. The reversal of 16551454260641 is 14606245415561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16060088310016 + 491365950625 = 4007504^2 + 700975^2 .
It is a cyclic number.
It is not a de Polignac number, because 16551454260641 - 230 = 16550380518817 is a prime.
It is a super-2 number, since 2×165514542606412 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16551454260641.
It is not a weakly prime, because it can be changed into another prime (16551454260631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8275727130320 + 8275727130321.
It is an arithmetic number, because the mean of its divisors is an integer number (8275727130321).
Almost surely, 216551454260641 is an apocalyptic number.
It is an amenable number.
16551454260641 is a deficient number, since it is larger than the sum of its proper divisors (1).
16551454260641 is an equidigital number, since it uses as much as digits as its factorization.
16551454260641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456000, while the sum is 50.
The spelling of 16551454260641 in words is "sixteen trillion, five hundred fifty-one billion, four hundred fifty-four million, two hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •