Base | Representation |
---|---|
bin | 1111000000101110001001… |
… | …0101100100010110100000 |
3 | 2011102212110010101021121200 |
4 | 3300023202111210112200 |
5 | 4130404331240442333 |
6 | 55034153132121200 |
7 | 3322310546164464 |
oct | 360134225442640 |
9 | 64385403337550 |
10 | 16505061655968 |
11 | 5293837022a16 |
12 | 1a2695b906200 |
13 | 9295611a1592 |
14 | 410bc64924a4 |
15 | 1d9504093c13 |
hex | f02e25645a0 |
16505061655968 has 72 divisors (see below), whose sum is σ = 47179462347108. Its totient is φ = 5473181048832.
The previous prime is 16505061655931. The next prime is 16505061655993. The reversal of 16505061655968 is 86955616050561.
It is a happy number.
16505061655968 is a `hidden beast` number, since 1 + 6 + 5 + 0 + 5 + 0 + 6 + 16 + 559 + 68 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 16213604198544 + 291457457424 = 4026612^2 + 539868^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 148413955 + ... + 148525122.
Almost surely, 216505061655968 is an apocalyptic number.
16505061655968 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
16505061655968 is an abundant number, since it is smaller than the sum of its proper divisors (30674400691140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16505061655968 is a wasteful number, since it uses less digits than its factorization.
16505061655968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296939286 (or 296939275 counting only the distinct ones).
The product of its (nonzero) digits is 58320000, while the sum is 63.
The spelling of 16505061655968 in words is "sixteen trillion, five hundred five billion, sixty-one million, six hundred fifty-five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •