Base | Representation |
---|---|
bin | 111110100000101000000111… |
… | …000111110101101001010100 |
3 | 1100001102012002111222112000101 |
4 | 332200220013013311221110 |
5 | 242013301124341042322 |
6 | 2412412541453223444 |
7 | 111623246034631423 |
oct | 7640500707655124 |
9 | 1301365074875011 |
10 | 274920976112212 |
11 | 7a664370927461 |
12 | 26a0163a791b84 |
13 | ba52c2421a311 |
14 | 4bc63639872ba |
15 | 21bb4d384b327 |
hex | fa0a071f5a54 |
274920976112212 has 12 divisors (see below), whose sum is σ = 483892700730516. Its totient is φ = 136665918760640.
The previous prime is 274920976112207. The next prime is 274920976112269. The reversal of 274920976112212 is 212211679029472.
It can be written as a sum of positive squares in 2 ways, for example, as 194317856762436 + 80603119349776 = 13939794^2 + 8977924^2 .
It is a super-2 number, since 2×2749209761122122 (a number of 30 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 198642323089 + ... + 198642324472.
It is an arithmetic number, because the mean of its divisors is an integer number (40324391727543).
Almost surely, 2274920976112212 is an apocalyptic number.
It is an amenable number.
274920976112212 is a deficient number, since it is larger than the sum of its proper divisors (208971724618304).
274920976112212 is a wasteful number, since it uses less digits than its factorization.
274920976112212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397284647738 (or 397284647736 counting only the distinct ones).
The product of its (nonzero) digits is 3048192, while the sum is 55.
The spelling of 274920976112212 in words is "two hundred seventy-four trillion, nine hundred twenty billion, nine hundred seventy-six million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •