Base | Representation |
---|---|
bin | 110011011101111111011101… |
… | …010010011100001111111111 |
3 | 1002200110221021100120101110022 |
4 | 303131333131102130033333 |
5 | 214132201043221001002 |
6 | 2121232551333402355 |
7 | 65452032603225242 |
oct | 6335773522341777 |
9 | 1080427240511408 |
10 | 226361374000127 |
11 | 66142357437793 |
12 | 2147a4261993bb |
13 | 993ca2aa358c2 |
14 | 3dc7d3dd2b259 |
15 | 1b282a372aba2 |
hex | cddfdd49c3ff |
226361374000127 has 8 divisors (see below), whose sum is σ = 227336698920240. Its totient is φ = 225386081703360.
The previous prime is 226361374000093. The next prime is 226361374000159. The reversal of 226361374000127 is 721000473163622.
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 226361374000127 - 26 = 226361374000063 is a prime.
It is a super-2 number, since 2×2263613740001272 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226361374000187) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5802677 + ... + 22054337.
It is an arithmetic number, because the mean of its divisors is an integer number (28417087365030).
Almost surely, 2226361374000127 is an apocalyptic number.
226361374000127 is a deficient number, since it is larger than the sum of its proper divisors (975324920113).
226361374000127 is a wasteful number, since it uses less digits than its factorization.
226361374000127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16311673.
The product of its (nonzero) digits is 508032, while the sum is 44.
The spelling of 226361374000127 in words is "two hundred twenty-six trillion, three hundred sixty-one billion, three hundred seventy-four million, one hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •