Base | Representation |
---|---|
bin | 11100111011011001101010… |
… | …010100100010100010001101 |
3 | 121200110210220122012222202110 |
4 | 130323121222110202202031 |
5 | 113133443010040330331 |
6 | 1130331230025414233 |
7 | 35540604136155423 |
oct | 3473315224424215 |
9 | 550423818188673 |
10 | 127227305011341 |
11 | 375a1884962927 |
12 | 1232960703a379 |
13 | 55cb638cb8ac2 |
14 | 235bb97905113 |
15 | ea971a50c946 |
hex | 73b66a52288d |
127227305011341 has 16 divisors (see below), whose sum is σ = 171515877369408. Its totient is φ = 83880427824000.
The previous prime is 127227305011271. The next prime is 127227305011393. The reversal of 127227305011341 is 143110503722721.
It is not a de Polignac number, because 127227305011341 - 210 = 127227305010317 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 127227305011341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127227305011441) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 244718215 + ... + 245237556.
It is an arithmetic number, because the mean of its divisors is an integer number (10719742335588).
Almost surely, 2127227305011341 is an apocalyptic number.
It is an amenable number.
127227305011341 is a deficient number, since it is larger than the sum of its proper divisors (44288572358067).
127227305011341 is a wasteful number, since it uses less digits than its factorization.
127227305011341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489956732.
The product of its (nonzero) digits is 70560, while the sum is 39.
The spelling of 127227305011341 in words is "one hundred twenty-seven trillion, two hundred twenty-seven billion, three hundred five million, eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •