Base | Representation |
---|---|
bin | 1111001101101110101010… |
… | …1101001100111100000000 |
3 | 2012020020021202000011000220 |
4 | 3303123222231030330000 |
5 | 4143040022313244030 |
6 | 55324552500343040 |
7 | 3344411552665032 |
oct | 363335255147400 |
9 | 65206252004026 |
10 | 16728540368640 |
11 | 536a596a20491 |
12 | 1a6212a3a4a80 |
13 | 9446577c0639 |
14 | 41b946875c52 |
15 | 1e0233888a10 |
hex | f36eab4cf00 |
16728540368640 has 144 divisors (see below), whose sum is σ = 53834615404416. Its totient is φ = 4426890956800.
The previous prime is 16728540368633. The next prime is 16728540368669. The reversal of 16728540368640 is 4686304582761.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 16124406 + ... + 17130485.
It is an arithmetic number, because the mean of its divisors is an integer number (373851495864).
Almost surely, 216728540368640 is an apocalyptic number.
16728540368640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16728540368640 is an abundant number, since it is smaller than the sum of its proper divisors (37106075035776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16728540368640 is a wasteful number, since it uses less digits than its factorization.
16728540368640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33255046 (or 33255032 counting only the distinct ones).
The product of its (nonzero) digits is 46448640, while the sum is 60.
The spelling of 16728540368640 in words is "sixteen trillion, seven hundred twenty-eight billion, five hundred forty million, three hundred sixty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •