Base | Representation |
---|---|
bin | 1111001001110011100011… |
… | …0000000011111101010101 |
3 | 2011222210021211000001020200 |
4 | 3302130320300003331111 |
5 | 4140433443321430110 |
6 | 55234003444051113 |
7 | 3336504224363634 |
oct | 362347060037525 |
9 | 64883254001220 |
10 | 16661130264405 |
11 | 5343a44752440 |
12 | 1a51056993a99 |
13 | 93b1a3abbab3 |
14 | 41858dbd151b |
15 | 1dd5da80e6c0 |
hex | f2738c03f55 |
16661130264405 has 48 divisors (see below), whose sum is σ = 32099110707456. Its totient is φ = 7925706322560.
The previous prime is 16661130264371. The next prime is 16661130264433. The reversal of 16661130264405 is 50446203116661.
It is not a de Polignac number, because 16661130264405 - 27 = 16661130264277 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 47 ways as a sum of consecutive naturals, for example, 317510077 + ... + 317562546.
It is an arithmetic number, because the mean of its divisors is an integer number (668731473072).
Almost surely, 216661130264405 is an apocalyptic number.
16661130264405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16661130264405 is a deficient number, since it is larger than the sum of its proper divisors (15437980443051).
16661130264405 is a wasteful number, since it uses less digits than its factorization.
16661130264405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635072698 (or 635072695 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 45.
The spelling of 16661130264405 in words is "sixteen trillion, six hundred sixty-one billion, one hundred thirty million, two hundred sixty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •