Base | Representation |
---|---|
bin | 1001100011010011111001… |
… | …0010101101100000110001 |
3 | 1101012000010011122102021012 |
4 | 2120310332102231200301 |
5 | 2334032041433143441 |
6 | 34200355034040305 |
7 | 2132522205125324 |
oct | 230647622554061 |
9 | 41160104572235 |
10 | 10502240131121 |
11 | 3389a7a841152 |
12 | 12174a2b79095 |
13 | 5b248441906b |
14 | 28444da787bb |
15 | 1332c256d9eb |
hex | 98d3e4ad831 |
10502240131121 has 8 divisors (see below), whose sum is σ = 10680533620800. Its totient is φ = 10323956288880.
The previous prime is 10502240131099. The next prime is 10502240131217. The reversal of 10502240131121 is 12113104220501.
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-10502240131121 is a prime.
It is a super-2 number, since 2×105022401311212 (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 (10502240131021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199085 + ... + 4587386.
It is an arithmetic number, because the mean of its divisors is an integer number (1335066702600).
Almost surely, 210502240131121 is an apocalyptic number.
It is an amenable number.
10502240131121 is a deficient number, since it is larger than the sum of its proper divisors (178293489679).
10502240131121 is an equidigital number, since it uses as much as digits as its factorization.
10502240131121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4823719.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 10502240131121 its reverse (12113104220501), we get a palindrome (22615344351622).
The spelling of 10502240131121 in words is "ten trillion, five hundred two billion, two hundred forty million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •