Base | Representation |
---|---|
bin | 1001100100101011111011… |
… | …1011011111101110011011 |
3 | 1101021021010012022210110201 |
4 | 2121022332323133232123 |
5 | 2334423442011031213 |
6 | 34215304103323031 |
7 | 2134316643324553 |
oct | 231127673375633 |
9 | 41237105283421 |
10 | 10525873142683 |
11 | 3398aa7a86568 |
12 | 121bb99750477 |
13 | 5b477c691782 |
14 | 285652664163 |
15 | 133c0721c6dd |
hex | 992beedfb9b |
10525873142683 has 8 divisors (see below), whose sum is σ = 10744978464000. Its totient is φ = 10308124511208.
The previous prime is 10525873142663. The next prime is 10525873142689. The reversal of 10525873142683 is 38624137852501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10525873142683 is a prime.
It is a super-2 number, since 2×105258731426832 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10525873142689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339156783 + ... + 339187816.
It is an arithmetic number, because the mean of its divisors is an integer number (1343122308000).
Almost surely, 210525873142683 is an apocalyptic number.
10525873142683 is a deficient number, since it is larger than the sum of its proper divisors (219105321317).
10525873142683 is an equidigital number, since it uses as much as digits as its factorization.
10525873142683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678344921.
The product of its (nonzero) digits is 9676800, while the sum is 55.
The spelling of 10525873142683 in words is "ten trillion, five hundred twenty-five billion, eight hundred seventy-three million, one hundred forty-two thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •