Base | Representation |
---|---|
bin | 1000000010101000100… |
… | …00110011001010001100 |
3 | 222102011020101100211220 |
4 | 10001110100303022030 |
5 | 14011321122100230 |
6 | 330532051443340 |
7 | 25650522552612 |
oct | 4012420631214 |
9 | 872136340756 |
10 | 276291596940 |
11 | a71a1449167 |
12 | 456695b6550 |
13 | 2009207a648 |
14 | d53052d6b2 |
15 | 72c10bbd10 |
hex | 405443328c |
276291596940 has 48 divisors (see below), whose sum is σ = 780462654048. Its totient is φ = 73025741824.
The previous prime is 276291596897. The next prime is 276291596969. The reversal of 276291596940 is 49695192672.
276291596940 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20368707 + ... + 20382266.
It is an arithmetic number, because the mean of its divisors is an integer number (16259638626).
Almost surely, 2276291596940 is an apocalyptic number.
276291596940 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
276291596940 is an abundant number, since it is smaller than the sum of its proper divisors (504171057108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276291596940 is a wasteful number, since it uses less digits than its factorization.
276291596940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40751098 (or 40751096 counting only the distinct ones).
The product of its (nonzero) digits is 14696640, while the sum is 60.
The spelling of 276291596940 in words is "two hundred seventy-six billion, two hundred ninety-one million, five hundred ninety-six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •