Base | Representation |
---|---|
bin | 111011101110000101… |
… | …1000011000001000001 |
3 | 110021000211010010100001 |
4 | 1313130023003001001 |
5 | 4100122432410131 |
6 | 134525530200001 |
7 | 12160050314152 |
oct | 1673413030101 |
9 | 407024103301 |
10 | 128247935041 |
11 | 4a431685866 |
12 | 20a31b83001 |
13 | c12abc8cc5 |
14 | 62c890d929 |
15 | 3509128261 |
hex | 1ddc2c3041 |
128247935041 has 4 divisors (see below), whose sum is σ = 128248654932. Its totient is φ = 128247215152.
The previous prime is 128247935029. The next prime is 128247935083. The reversal of 128247935041 is 140539742821.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 46794775041 + 81453160000 = 216321^2 + 285400^2 .
It is a cyclic number.
It is not a de Polignac number, because 128247935041 - 223 = 128239546433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 128247934982 and 128247935000.
It is not an unprimeable number, because it can be changed into a prime (128247935021) 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, 125631 + ... + 521803.
It is an arithmetic number, because the mean of its divisors is an integer number (32062163733).
Almost surely, 2128247935041 is an apocalyptic number.
It is an amenable number.
128247935041 is a deficient number, since it is larger than the sum of its proper divisors (719891).
128247935041 is an equidigital number, since it uses as much as digits as its factorization.
128247935041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 719890.
The product of its (nonzero) digits is 483840, while the sum is 46.
The spelling of 128247935041 in words is "one hundred twenty-eight billion, two hundred forty-seven million, nine hundred thirty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •