Base | Representation |
---|---|
bin | 111110110110100010110110… |
… | …110101111001011110001010 |
3 | 1100020202011211020212120022110 |
4 | 332312202312311321132022 |
5 | 242212440312131043111 |
6 | 2415524515132203150 |
7 | 112140126533062344 |
oct | 7666426665713612 |
9 | 1306664736776273 |
10 | 276427162752906 |
11 | 80095112a29540 |
12 | 270055296094b6 |
13 | bb31c7b28a059 |
14 | 4c39208b28294 |
15 | 21e5788de95a6 |
hex | fb68b6d7978a |
276427162752906 has 32 divisors (see below), whose sum is σ = 604372919961600. Its totient is φ = 83590930461680.
The previous prime is 276427162752901. The next prime is 276427162752931. The reversal of 276427162752906 is 609257261724672.
It is a super-2 number, since 2×2764271627529062 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (276427162752901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4371878976 + ... + 4371942203.
It is an arithmetic number, because the mean of its divisors is an integer number (18886653748800).
Almost surely, 2276427162752906 is an apocalyptic number.
276427162752906 is an abundant number, since it is smaller than the sum of its proper divisors (327945757208694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276427162752906 is a wasteful number, since it uses less digits than its factorization.
276427162752906 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8743821674.
The product of its (nonzero) digits is 213373440, while the sum is 66.
The spelling of 276427162752906 in words is "two hundred seventy-six trillion, four hundred twenty-seven billion, one hundred sixty-two million, seven hundred fifty-two thousand, nine hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •