Base | Representation |
---|---|
bin | 1111001001110000010110… |
… | …0010001111011011011000 |
3 | 2011222201001221011001200020 |
4 | 3302130011202033123120 |
5 | 4140430213334101402 |
6 | 55233342311110440 |
7 | 3336444021651444 |
oct | 362340542173330 |
9 | 64881057131606 |
10 | 16660271003352 |
11 | 5343643715939 |
12 | 1a50a57072420 |
13 | 93b097a8a3c2 |
14 | 41850ba3b824 |
15 | 1dd58a17d8bc |
hex | f270588f6d8 |
16660271003352 has 64 divisors (see below), whose sum is σ = 41932515302400. Its totient is φ = 5515855833600.
The previous prime is 16660271003333. The next prime is 16660271003359. The reversal of 16660271003352 is 25330017206661.
16660271003352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16660271003359) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25248849 + ... + 25900287.
It is an arithmetic number, because the mean of its divisors is an integer number (655195551600).
Almost surely, 216660271003352 is an apocalyptic number.
16660271003352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16660271003352 is an abundant number, since it is smaller than the sum of its proper divisors (25272244299048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16660271003352 is a wasteful number, since it uses less digits than its factorization.
16660271003352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 658656 (or 658652 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 42.
The spelling of 16660271003352 in words is "sixteen trillion, six hundred sixty billion, two hundred seventy-one million, three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •