Base | Representation |
---|---|
bin | 1001100011010110110001… |
… | …0011100110001010110001 |
3 | 1101012002002222021021020012 |
4 | 2120311230103212022301 |
5 | 2334040132100140441 |
6 | 34201003412224305 |
7 | 2132550300645461 |
oct | 230655423461261 |
9 | 41162088237205 |
10 | 10503012115121 |
11 | 338a336587159 |
12 | 121767960b095 |
13 | 5b2578340026 |
14 | 2844c43cdba1 |
15 | 13331a20e9eb |
hex | 98d6c4e62b1 |
10503012115121 has 8 divisors (see below), whose sum is σ = 10526311238400. Its totient is φ = 10479718710160.
The previous prime is 10503012115109. The next prime is 10503012115181. The reversal of 10503012115121 is 12151121030501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10503012115121 - 214 = 10503012098737 is a prime.
It is a super-2 number, since 2×105030121151212 (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 (10503012115181) 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, 2258495 + ... + 5109483.
It is an arithmetic number, because the mean of its divisors is an integer number (1315788904800).
Almost surely, 210503012115121 is an apocalyptic number.
It is an amenable number.
10503012115121 is a deficient number, since it is larger than the sum of its proper divisors (23299123279).
10503012115121 is an equidigital number, since it uses as much as digits as its factorization.
10503012115121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859159.
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 10503012115121 its reverse (12151121030501), we get a palindrome (22654133145622).
The spelling of 10503012115121 in words is "ten trillion, five hundred three billion, twelve million, one hundred fifteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •