Base | Representation |
---|---|
bin | 1011111011111011111100… |
… | …1110101111000000100111 |
3 | 1201110200012100201200012001 |
4 | 2332332333032233000213 |
5 | 3210012113322300403 |
6 | 43525122512510131 |
7 | 2523126134146342 |
oct | 276767716570047 |
9 | 51420170650161 |
10 | 13124333400103 |
11 | 41aaaa9065512 |
12 | 157b70084b347 |
13 | 742808887753 |
14 | 335314aab459 |
15 | 17b5d9cbcc1d |
hex | befbf3af027 |
13124333400103 has 4 divisors (see below), whose sum is σ = 13125019156920. Its totient is φ = 13123647643288.
The previous prime is 13124333400083. The next prime is 13124333400121. The reversal of 13124333400103 is 30100433342131.
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 13124333400103 - 29 = 13124333399591 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 (13124333400133) 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 3 ways as a sum of consecutive naturals, for example, 342849700 + ... + 342887977.
It is an arithmetic number, because the mean of its divisors is an integer number (3281254789230).
Almost surely, 213124333400103 is an apocalyptic number.
13124333400103 is a deficient number, since it is larger than the sum of its proper divisors (685756817).
13124333400103 is an equidigital number, since it uses as much as digits as its factorization.
13124333400103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685756816.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 13124333400103 its reverse (30100433342131), we get a palindrome (43224766742234).
The spelling of 13124333400103 in words is "thirteen trillion, one hundred twenty-four billion, three hundred thirty-three million, four hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •