Base | Representation |
---|---|
bin | 1011111011110000000001… |
… | …0111011011001110010111 |
3 | 1201110100221012021120202011 |
4 | 2332330000113123032113 |
5 | 3204434034043330403 |
6 | 43523433043125051 |
7 | 2522653602150631 |
oct | 276740027331627 |
9 | 51410835246664 |
10 | 13121131230103 |
11 | 41a970556a826 |
12 | 157ab68373787 |
13 | 7424183392c0 |
14 | 3350cd6b9a51 |
15 | 17b49dae1a6d |
hex | bef005db397 |
13121131230103 has 8 divisors (see below), whose sum is σ = 14131282270448. Its totient is φ = 12111099225984.
The previous prime is 13121131230083. The next prime is 13121131230169. The reversal of 13121131230103 is 30103213112131.
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 13121131230103 - 241 = 10922107974551 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 (13121131233103) 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, 29530050 + ... + 29971087.
It is an arithmetic number, because the mean of its divisors is an integer number (1766410283806).
Almost surely, 213121131230103 is an apocalyptic number.
13121131230103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13121131230103 is a deficient number, since it is larger than the sum of its proper divisors (1010151040345).
13121131230103 is a wasteful number, since it uses less digits than its factorization.
13121131230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59518113.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13121131230103 its reverse (30103213112131), we get a palindrome (43224344342234).
The spelling of 13121131230103 in words is "thirteen trillion, one hundred twenty-one billion, one hundred thirty-one million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •