Base | Representation |
---|---|
bin | 1111011001011000010… |
… | …1110010000010100100 |
3 | 221021202020022021101201 |
4 | 3312112011302002210 |
5 | 13313204320300030 |
6 | 321303102532244 |
7 | 25052555164624 |
oct | 3662605620244 |
9 | 837666267351 |
10 | 264511103140 |
11 | a21a6692879 |
12 | 43320297084 |
13 | 1bc3553c85b |
14 | cb33b30884 |
15 | 6d31c5a2ca |
hex | 3d961720a4 |
264511103140 has 24 divisors (see below), whose sum is σ = 558576527040. Its totient is φ = 105213353568.
The previous prime is 264511103071. The next prime is 264511103191. The reversal of 264511103140 is 41301115462.
It is a super-2 number, since 2×2645111031402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 264511103099 and 264511103108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36939312 + ... + 36946471.
It is an arithmetic number, because the mean of its divisors is an integer number (23274021960).
Almost surely, 2264511103140 is an apocalyptic number.
264511103140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
264511103140 is an abundant number, since it is smaller than the sum of its proper divisors (294065423900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264511103140 is a wasteful number, since it uses less digits than its factorization.
264511103140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73885971 (or 73885969 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 264511103140 in words is "two hundred sixty-four billion, five hundred eleven million, one hundred three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •