Base | Representation |
---|---|
bin | 10111011100100111000111… |
… | …001101011111001100101111 |
3 | 111112010021212120100222012002 |
4 | 113130213013031133030233 |
5 | 102004014220233330221 |
6 | 1003153121504202515 |
7 | 30502155523404404 |
oct | 2734470715371457 |
9 | 445107776328162 |
10 | 103121212011311 |
11 | 2a9485078a800a |
12 | b6956b930943b |
13 | 4570399c9b860 |
14 | 1b67143dca2ab |
15 | bdc6455c880b |
hex | 5dc9c735f32f |
103121212011311 has 32 divisors (see below), whose sum is σ = 119441568254400. Its totient is φ = 88326536094720.
The previous prime is 103121212011179. The next prime is 103121212011319. The reversal of 103121212011311 is 113110212121301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103121212011311 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 (103121212011319) 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 31 ways as a sum of consecutive naturals, for example, 48751616 + ... + 50822853.
It is an arithmetic number, because the mean of its divisors is an integer number (3732549007950).
Almost surely, 2103121212011311 is an apocalyptic number.
103121212011311 is a deficient number, since it is larger than the sum of its proper divisors (16320356243089).
103121212011311 is a wasteful number, since it uses less digits than its factorization.
103121212011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99574619.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 103121212011311 its reverse (113110212121301), we get a palindrome (216231424132612).
The spelling of 103121212011311 in words is "one hundred three trillion, one hundred twenty-one billion, two hundred twelve million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •