Base | Representation |
---|---|
bin | 1110111101000101100010… |
… | …0111010010001010011001 |
3 | 2011012220021120012211001110 |
4 | 3233101120213102022121 |
5 | 4123343442101031410 |
6 | 54545345215010533 |
7 | 3314640326504541 |
oct | 357213047221231 |
9 | 64186246184043 |
10 | 16442621502105 |
11 | 526a3051a8177 |
12 | 1a16834809a49 |
13 | 9236c0039b86 |
14 | 40bb818ca321 |
15 | 1d7a9c4d7720 |
hex | ef4589d2299 |
16442621502105 has 32 divisors (see below), whose sum is σ = 26316484735104. Its totient is φ = 8766635222016.
The previous prime is 16442621502079. The next prime is 16442621502217. The reversal of 16442621502105 is 50120512624461.
16442621502105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16442621502105 - 219 = 16442620977817 is a prime.
It is a super-3 number, since 3×164426215021053 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1062657649 + ... + 1062673121.
It is an arithmetic number, because the mean of its divisors is an integer number (822390147972).
Almost surely, 216442621502105 is an apocalyptic number.
16442621502105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16442621502105 is a deficient number, since it is larger than the sum of its proper divisors (9873863232999).
16442621502105 is a wasteful number, since it uses less digits than its factorization.
16442621502105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33225.
The product of its (nonzero) digits is 115200, while the sum is 39.
The spelling of 16442621502105 in words is "sixteen trillion, four hundred forty-two billion, six hundred twenty-one million, five hundred two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •