Base | Representation |
---|---|
bin | 1111001001010… |
… | …00101010011100 |
3 | 22212001111221200 |
4 | 13210220222130 |
5 | 230010404002 |
6 | 20334555500 |
7 | 3101600256 |
oct | 744505234 |
9 | 285044850 |
10 | 127044252 |
11 | 65793255 |
12 | 36668b90 |
13 | 2042231a |
14 | 12c30cd6 |
15 | b247b1c |
hex | 7928a9c |
127044252 has 36 divisors (see below), whose sum is σ = 321482616. Its totient is φ = 42302880.
The previous prime is 127044221. The next prime is 127044257. The reversal of 127044252 is 252440721.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1270442522 = 32280483932479008, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127044257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61663 + ... + 63689.
Almost surely, 2127044252 is an apocalyptic number.
127044252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
127044252 is an abundant number, since it is smaller than the sum of its proper divisors (194438364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127044252 is a wasteful number, since it uses less digits than its factorization.
127044252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3778 (or 3773 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 27.
The square root of 127044252 is about 11271.3908635980. The cubic root of 127044252 is about 502.7109443306.
Adding to 127044252 its reverse (252440721), we get a palindrome (379484973).
The spelling of 127044252 in words is "one hundred twenty-seven million, forty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •