Base | Representation |
---|---|
bin | 10011011111000111101100… |
… | …11011011000000111011101 |
3 | 12121201111012220210221020021 |
4 | 21233203312123120013131 |
5 | 21104031242344213301 |
6 | 231045204105152141 |
7 | 12011601663163561 |
oct | 1157436633300735 |
9 | 177644186727207 |
10 | 42850728116701 |
11 | 127209899a653a |
12 | 498091218b651 |
13 | 1abaa636502ab |
14 | a81db45d76a1 |
15 | 4e49a47598a1 |
hex | 26f8f66d81dd |
42850728116701 has 4 divisors (see below), whose sum is σ = 44328339431100. Its totient is φ = 41373116802304.
The previous prime is 42850728116671. The next prime is 42850728116773. The reversal of 42850728116701 is 10761182705824.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19119936843225 + 23730791273476 = 4372635^2 + 4871426^2 .
It is a cyclic number.
It is not a de Polignac number, because 42850728116701 - 229 = 42850191245789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42850728113701) 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, 738805657156 + ... + 738805657213.
It is an arithmetic number, because the mean of its divisors is an integer number (11082084857775).
Almost surely, 242850728116701 is an apocalyptic number.
It is an amenable number.
42850728116701 is a deficient number, since it is larger than the sum of its proper divisors (1477611314399).
42850728116701 is a wasteful number, since it uses less digits than its factorization.
42850728116701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1477611314398.
The product of its (nonzero) digits is 1505280, while the sum is 52.
The spelling of 42850728116701 in words is "forty-two trillion, eight hundred fifty billion, seven hundred twenty-eight million, one hundred sixteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •