Base | Representation |
---|---|
bin | 111011001100111001… |
… | …0111010111011111000 |
3 | 110011011012122022202220 |
4 | 1312121302322323320 |
5 | 4040332341023412 |
6 | 134223225324040 |
7 | 12120335561232 |
oct | 1663162727370 |
9 | 404135568686 |
10 | 127134314232 |
11 | 49a10007a92 |
12 | 20781036620 |
13 | bcb1289693 |
14 | 6220a67252 |
15 | 34914a168c |
hex | 1d99cbaef8 |
127134314232 has 16 divisors (see below), whose sum is σ = 317835785640. Its totient is φ = 42378104736.
The previous prime is 127134314221. The next prime is 127134314233. The reversal of 127134314232 is 232413431721.
It is a junction number, because it is equal to n+sod(n) for n = 127134314193 and 127134314202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127134314233) 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 3 ways as a sum of consecutive naturals, for example, 2648631523 + ... + 2648631570.
Almost surely, 2127134314232 is an apocalyptic number.
127134314232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
127134314232 is an abundant number, since it is smaller than the sum of its proper divisors (190701471408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127134314232 is a wasteful number, since it uses less digits than its factorization.
127134314232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5297263102 (or 5297263098 counting only the distinct ones).
The product of its digits is 24192, while the sum is 33.
Adding to 127134314232 its reverse (232413431721), we get a palindrome (359547745953).
The spelling of 127134314232 in words is "one hundred twenty-seven billion, one hundred thirty-four million, three hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •