Base | Representation |
---|---|
bin | 111011100111110110… |
… | …1010111010111000001 |
3 | 110020111020122100122201 |
4 | 1313033231113113001 |
5 | 4044210414434312 |
6 | 134453100233201 |
7 | 12151631035102 |
oct | 1671755272701 |
9 | 406436570581 |
10 | 128038827457 |
11 | 4a334642182 |
12 | 20993b3b801 |
13 | c0c67a33c8 |
14 | 62a8c3a3a9 |
15 | 34e5ac0557 |
hex | 1dcfb575c1 |
128038827457 has 4 divisors (see below), whose sum is σ = 129842191296. Its totient is φ = 126235463620.
The previous prime is 128038827451. The next prime is 128038827491. The reversal of 128038827457 is 754728830821.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-128038827457 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 128038827398 and 128038827407.
It is not an unprimeable number, because it can be changed into a prime (128038827451) 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, 901681813 + ... + 901681954.
It is an arithmetic number, because the mean of its divisors is an integer number (32460547824).
Almost surely, 2128038827457 is an apocalyptic number.
It is an amenable number.
128038827457 is a deficient number, since it is larger than the sum of its proper divisors (1803363839).
128038827457 is an equidigital number, since it uses as much as digits as its factorization.
128038827457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1803363838.
The product of its (nonzero) digits is 6021120, while the sum is 55.
The spelling of 128038827457 in words is "one hundred twenty-eight billion, thirty-eight million, eight hundred twenty-seven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •