Base | Representation |
---|---|
bin | 11100111010100110010000… |
… | …010000110101100010111101 |
3 | 121200021112102210102111001221 |
4 | 130322212100100311202331 |
5 | 113132041433342444442 |
6 | 1130250020500433341 |
7 | 35533611235622563 |
oct | 3472462020654275 |
9 | 550245383374057 |
10 | 127172106999997 |
11 | 3758042a038a34 |
12 | 1231a9813a8851 |
13 | 55c638037b427 |
14 | 235923cacba33 |
15 | ea808964b467 |
hex | 73a9904358bd |
127172106999997 has 8 divisors (see below), whose sum is σ = 130275408070080. Its totient is φ = 124068879375840.
The previous prime is 127172106999983. The next prime is 127172107000009. The reversal of 127172106999997 is 799999601271721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-127172106999997 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 (127172106999947) 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 7 ways as a sum of consecutive naturals, for example, 14848113 + ... + 21790150.
It is an arithmetic number, because the mean of its divisors is an integer number (16284426008760).
Almost surely, 2127172106999997 is an apocalyptic number.
It is an amenable number.
127172106999997 is a deficient number, since it is larger than the sum of its proper divisors (3103301070083).
127172106999997 is an equidigital number, since it uses as much as digits as its factorization.
127172106999997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36722963.
The product of its (nonzero) digits is 486091368, while the sum is 79.
The spelling of 127172106999997 in words is "one hundred twenty-seven trillion, one hundred seventy-two billion, one hundred six million, nine hundred ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •