Base | Representation |
---|---|
bin | 111011001010010010… |
… | …0011110010101111101 |
3 | 110010221002200001201221 |
4 | 1312110210132111331 |
5 | 4040142420003041 |
6 | 134210414233341 |
7 | 12115222426216 |
oct | 1662444362575 |
9 | 403832601657 |
10 | 127046641021 |
11 | 49975575893 |
12 | 207577b5851 |
13 | bc99070841 |
14 | 621316440d |
15 | 34889342d1 |
hex | 1d9491e57d |
127046641021 has 4 divisors (see below), whose sum is σ = 130001214112. Its totient is φ = 124092067932.
The previous prime is 127046641003. The next prime is 127046641031. The reversal of 127046641021 is 120146640721.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 120146640721 = 61 ⋅1969617061.
It is a cyclic number.
It is not a de Polignac number, because 127046641021 - 211 = 127046638973 is a prime.
It is a super-2 number, since 2×1270466410212 (a number of 23 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 (127046641031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1477286481 + ... + 1477286566.
It is an arithmetic number, because the mean of its divisors is an integer number (32500303528).
Almost surely, 2127046641021 is an apocalyptic number.
It is an amenable number.
127046641021 is a deficient number, since it is larger than the sum of its proper divisors (2954573091).
127046641021 is an equidigital number, since it uses as much as digits as its factorization.
127046641021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2954573090.
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 127046641021 in words is "one hundred twenty-seven billion, forty-six million, six hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •