Base | Representation |
---|---|
bin | 1001001101111000100000… |
… | …0011010100110000100111 |
3 | 1022212210220120122200021221 |
4 | 2103132020003110300213 |
5 | 2312014124232032403 |
6 | 33315313540521211 |
7 | 2064110463214351 |
oct | 223361003246047 |
9 | 38783816580257 |
10 | 10134110424103 |
11 | 3257941158666 |
12 | 11780850b0207 |
13 | 5868477a4b63 |
14 | 2706ca4940d1 |
15 | 128928a8edbd |
hex | 937880d4c27 |
10134110424103 has 4 divisors (see below), whose sum is σ = 10134169226800. Its totient is φ = 10134051621408.
The previous prime is 10134110424089. The next prime is 10134110424253. The reversal of 10134110424103 is 30142401143101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10134110424103 - 225 = 10134076869671 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 (10134110464103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29142075 + ... + 29487772.
It is an arithmetic number, because the mean of its divisors is an integer number (2533542306700).
Almost surely, 210134110424103 is an apocalyptic number.
10134110424103 is a deficient number, since it is larger than the sum of its proper divisors (58802697).
10134110424103 is an equidigital number, since it uses as much as digits as its factorization.
10134110424103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58802696.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 10134110424103 its reverse (30142401143101), we get a palindrome (40276511567204).
The spelling of 10134110424103 in words is "ten trillion, one hundred thirty-four billion, one hundred ten million, four hundred twenty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •