Base | Representation |
---|---|
bin | 1000000010000111101… |
… | …11111111111010010100 |
3 | 222101110002001010102120 |
4 | 10001003313333322110 |
5 | 14010240231110431 |
6 | 330444510535540 |
7 | 25640643620541 |
oct | 4010367777224 |
9 | 871402033376 |
10 | 276016660116 |
11 | a707023304a |
12 | 455b15075b0 |
13 | 2004a116732 |
14 | d505c01bc8 |
15 | 72a6dae196 |
hex | 4043dffe94 |
276016660116 has 12 divisors (see below), whose sum is σ = 644038873632. Its totient is φ = 92005553368.
The previous prime is 276016660111. The next prime is 276016660267. The reversal of 276016660116 is 611066610672.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (276016660111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11500694160 + ... + 11500694183.
It is an arithmetic number, because the mean of its divisors is an integer number (53669906136).
Almost surely, 2276016660116 is an apocalyptic number.
It is an amenable number.
276016660116 is an abundant number, since it is smaller than the sum of its proper divisors (368022213516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276016660116 is a wasteful number, since it uses less digits than its factorization.
276016660116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23001388350 (or 23001388348 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 42.
It can be divided in two parts, 2760166 and 60116, that added together give a palindrome (2820282).
The spelling of 276016660116 in words is "two hundred seventy-six billion, sixteen million, six hundred sixty thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •