Base | Representation |
---|---|
bin | 1111001001110000010011… |
… | …1011001001001010010000 |
3 | 2011222201001012212100021222 |
4 | 3302130010323021022100 |
5 | 4140430203223112224 |
6 | 55233341303304212 |
7 | 3336443535563234 |
oct | 362340473111220 |
9 | 64881035770258 |
10 | 16660260754064 |
11 | 5343638955454 |
12 | 1a50a5374b068 |
13 | 93b09590c235 |
14 | 41850a5305c4 |
15 | 1dd589306b5e |
hex | f2704ec9290 |
16660260754064 has 10 divisors (see below), whose sum is σ = 32279255211030. Its totient is φ = 8330130377024.
The previous prime is 16660260754063. The next prime is 16660260754121. The reversal of 16660260754064 is 46045706206661.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 15491466246400 + 1168794507664 = 3935920^2 + 1081108^2 .
It is a junction number, because it is equal to n+sod(n) for n = 16660260753997 and 16660260754015.
It is not an unprimeable number, because it can be changed into a prime (16660260754063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520633148549 + ... + 520633148580.
It is an arithmetic number, because the mean of its divisors is an integer number (3227925521103).
Almost surely, 216660260754064 is an apocalyptic number.
It is an amenable number.
16660260754064 is a deficient number, since it is larger than the sum of its proper divisors (15618994456966).
16660260754064 is a wasteful number, since it uses less digits than its factorization.
16660260754064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041266297137 (or 1041266297131 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 53.
The spelling of 16660260754064 in words is "sixteen trillion, six hundred sixty billion, two hundred sixty million, seven hundred fifty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •