Base | Representation |
---|---|
bin | 101101011010110110101… |
… | …011001100001000100111 |
3 | 102001101101120012200200102 |
4 | 231122312223030020213 |
5 | 402114220011011403 |
6 | 10345510424334315 |
7 | 441333343013243 |
oct | 55326653141047 |
9 | 12041346180612 |
10 | 3121211032103 |
11 | aa377529217a |
12 | 424ab331439b |
13 | 1984378a1cc8 |
14 | ab0d3001423 |
15 | 562cabb3b88 |
hex | 2d6b6acc227 |
3121211032103 has 4 divisors (see below), whose sum is σ = 3145037070648. Its totient is φ = 3097384993560.
The previous prime is 3121211032097. The next prime is 3121211032127. The reversal of 3121211032103 is 3012301121213.
It is a happy number.
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 3121211032103 - 214 = 3121211015719 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 (3121211032403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11913019076 + ... + 11913019337.
It is an arithmetic number, because the mean of its divisors is an integer number (786259267662).
Almost surely, 23121211032103 is an apocalyptic number.
3121211032103 is a deficient number, since it is larger than the sum of its proper divisors (23826038545).
3121211032103 is a wasteful number, since it uses less digits than its factorization.
3121211032103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23826038544.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3121211032103 its reverse (3012301121213), we get a palindrome (6133512153316).
It can be divided in two parts, 31212110 and 32103, that added together give a palindrome (31244213).
The spelling of 3121211032103 in words is "three trillion, one hundred twenty-one billion, two hundred eleven million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •