Base | Representation |
---|---|
bin | 10111011101111001111010… |
… | …100110110111010100101111 |
3 | 111112102210100210120020021110 |
4 | 113131321322212313110233 |
5 | 102011443312002200221 |
6 | 1003302024115203103 |
7 | 30511454005430655 |
oct | 2735717246672457 |
9 | 445383323506243 |
10 | 103210121131311 |
11 | 2a982191772887 |
12 | b6aa9908a6493 |
13 | 4578898ab42bc |
14 | 1b6b57a080dd5 |
15 | bdeaeacc1776 |
hex | 5dde7a9b752f |
103210121131311 has 32 divisors (see below), whose sum is σ = 140164674951168. Its totient is φ = 67542134726880.
The previous prime is 103210121131297. The next prime is 103210121131349. The reversal of 103210121131311 is 113131121012301.
It is not a de Polignac number, because 103210121131311 - 25 = 103210121131279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103210121131391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 98069880 + ... + 99116706.
It is an arithmetic number, because the mean of its divisors is an integer number (4380146092224).
Almost surely, 2103210121131311 is an apocalyptic number.
103210121131311 is a deficient number, since it is larger than the sum of its proper divisors (36954553819857).
103210121131311 is a wasteful number, since it uses less digits than its factorization.
103210121131311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049451.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 103210121131311 its reverse (113131121012301), we get a palindrome (216341242143612).
The spelling of 103210121131311 in words is "one hundred three trillion, two hundred ten billion, one hundred twenty-one million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •