Base | Representation |
---|---|
bin | 111110011000011110110011… |
… | …000100000111111101000100 |
3 | 1022222102200021011022001211200 |
4 | 332120132303010013331010 |
5 | 241430113234321312004 |
6 | 2411303445435302500 |
7 | 111534641541233505 |
oct | 7630366304077504 |
9 | 1288380234261750 |
10 | 274361220104004 |
11 | 7a468a38191610 |
12 | 269310615aaa30 |
13 | ba121c9060107 |
14 | 4ba7222464bac |
15 | 21abb71b0e239 |
hex | f987b3107f44 |
274361220104004 has 72 divisors (see below), whose sum is σ = 756574256841312. Its totient is φ = 83139499111680.
The previous prime is 274361220103963. The next prime is 274361220104017. The reversal of 274361220104004 is 400401022163472.
274361220104004 is a `hidden beast` number, since 2 + 7 + 4 + 3 + 612 + 20 + 10 + 4 + 0 + 0 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 274361220104004.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 149422167 + ... + 151247169.
Almost surely, 2274361220104004 is an apocalyptic number.
It is an amenable number.
274361220104004 is an abundant number, since it is smaller than the sum of its proper divisors (482213036737308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
274361220104004 is a wasteful number, since it uses less digits than its factorization.
274361220104004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2204657 (or 2204652 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 36.
Adding to 274361220104004 its reverse (400401022163472), we get a palindrome (674762242267476).
The spelling of 274361220104004 in words is "two hundred seventy-four trillion, three hundred sixty-one billion, two hundred twenty million, one hundred four thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •