Base | Representation |
---|---|
bin | 1111001011000… |
… | …00110000010001 |
3 | 22212111012002220 |
4 | 13211200300101 |
5 | 230040232001 |
6 | 20343531253 |
7 | 3103545141 |
oct | 745406021 |
9 | 285435086 |
10 | 127274001 |
11 | 6592a928 |
12 | 36759b29 |
13 | 204a2a7a |
14 | 12c90921 |
15 | b290c36 |
hex | 7960c11 |
127274001 has 4 divisors (see below), whose sum is σ = 169698672. Its totient is φ = 84849332.
The previous prime is 127273997. The next prime is 127274009. The reversal of 127274001 is 100472721.
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: 100472721 = 3 ⋅33490907.
It is a cyclic number.
It is not a de Polignac number, because 127274001 - 22 = 127273997 is a prime.
It is a super-3 number, since 3×1272740013 (a number of 25 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (127274009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21212331 + ... + 21212336.
It is an arithmetic number, because the mean of its divisors is an integer number (42424668).
Almost surely, 2127274001 is an apocalyptic number.
It is an amenable number.
127274001 is a deficient number, since it is larger than the sum of its proper divisors (42424671).
127274001 is an equidigital number, since it uses as much as digits as its factorization.
127274001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42424670.
The product of its (nonzero) digits is 784, while the sum is 24.
The square root of 127274001 is about 11281.5779481418. The cubic root of 127274001 is about 503.0137988671.
The spelling of 127274001 in words is "one hundred twenty-seven million, two hundred seventy-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •