Base | Representation |
---|---|
bin | 1111000011101001000000… |
… | …0010111100100010100001 |
3 | 2011121122220210101012020202 |
4 | 3300322100002330202201 |
5 | 4132220042441301040 |
6 | 55113210253314545 |
7 | 3326034541460222 |
oct | 360722002744241 |
9 | 64548823335222 |
10 | 16555220650145 |
11 | 5303036510711 |
12 | 1a34619a95a55 |
13 | 9311c5b6bca8 |
14 | 4133c3d6d249 |
15 | 1da98c893015 |
hex | f0e900bc8a1 |
16555220650145 has 8 divisors (see below), whose sum is σ = 19885496407656. Its totient is φ = 13231355435136.
The previous prime is 16555220650109. The next prime is 16555220650183. The reversal of 16555220650145 is 54105602255561.
It can be written as a sum of positive squares in 4 ways, for example, as 11673312724129 + 4881907926016 = 3416623^2 + 2209504^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16555220650145 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16555220650145.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1602629942 + ... + 1602640271.
It is an arithmetic number, because the mean of its divisors is an integer number (2485687050957).
Almost surely, 216555220650145 is an apocalyptic number.
It is an amenable number.
16555220650145 is a deficient number, since it is larger than the sum of its proper divisors (3330275757511).
16555220650145 is a wasteful number, since it uses less digits than its factorization.
16555220650145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3205271251.
The product of its (nonzero) digits is 1800000, while the sum is 47.
The spelling of 16555220650145 in words is "sixteen trillion, five hundred fifty-five billion, two hundred twenty million, six hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •