Base | Representation |
---|---|
bin | 111110011110011111011100… |
… | …100111010110110011010101 |
3 | 1100000220011022210221012201212 |
4 | 332132133130213112303111 |
5 | 242003400112410104013 |
6 | 2412221312430031205 |
7 | 111606532446053204 |
oct | 7636373447266325 |
9 | 1300804283835655 |
10 | 274774234066133 |
11 | 7a60810986530a |
12 | 26999107048505 |
13 | ba4213991b259 |
14 | 4bbd202b8923b |
15 | 21b7795cb66a8 |
hex | f9e7dc9d6cd5 |
274774234066133 has 8 divisors (see below), whose sum is σ = 274802060364000. Its totient is φ = 274746408878448.
The previous prime is 274774234066121. The next prime is 274774234066177. The reversal of 274774234066133 is 331660432477472.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 274774234066133 - 230 = 274773160324309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (274774234066193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 548636210 + ... + 549136812.
It is an arithmetic number, because the mean of its divisors is an integer number (34350257545500).
Almost surely, 2274774234066133 is an apocalyptic number.
It is an amenable number.
274774234066133 is a deficient number, since it is larger than the sum of its proper divisors (27826297867).
274774234066133 is a wasteful number, since it uses less digits than its factorization.
274774234066133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555091.
The product of its (nonzero) digits is 85349376, while the sum is 59.
The spelling of 274774234066133 in words is "two hundred seventy-four trillion, seven hundred seventy-four billion, two hundred thirty-four million, sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •