Base | Representation |
---|---|
bin | 1001010010011100101001… |
… | …0011010110111101001101 |
3 | 1100011022022212102201020220 |
4 | 2110213022103112331031 |
5 | 2314310231010204424 |
6 | 33415323325101553 |
7 | 2102555022030534 |
oct | 224471223267515 |
9 | 40138285381226 |
10 | 10212531334989 |
11 | 3288123775715 |
12 | 118b3100b78b9 |
13 | 591064715ac9 |
14 | 27440961d31b |
15 | 12a9b85e0579 |
hex | 949ca4d6f4d |
10212531334989 has 4 divisors (see below), whose sum is σ = 13616708446656. Its totient is φ = 6808354223324.
The previous prime is 10212531334949. The next prime is 10212531335081. The reversal of 10212531334989 is 98943313521201.
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 not a de Polignac number, because 10212531334989 - 239 = 9662775521101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212531334919) 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, 1702088555829 + ... + 1702088555834.
It is an arithmetic number, because the mean of its divisors is an integer number (3404177111664).
Almost surely, 210212531334989 is an apocalyptic number.
It is an amenable number.
10212531334989 is a deficient number, since it is larger than the sum of its proper divisors (3404177111667).
10212531334989 is an equidigital number, since it uses as much as digits as its factorization.
10212531334989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3404177111666.
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 10212531334989 in words is "ten trillion, two hundred twelve billion, five hundred thirty-one million, three hundred thirty-four thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •