Base | Representation |
---|---|
bin | 100001111011000111000… |
… | …001100001110100101111 |
3 | 22020212021010102021200121 |
4 | 201323013001201310233 |
5 | 301143310100403403 |
6 | 4542535501305411 |
7 | 330265406311111 |
oct | 41730701416457 |
9 | 8225233367617 |
10 | 2331211341103 |
11 | 819730033667 |
12 | 317979b65267 |
13 | 13baa86c0648 |
14 | 80b8cc7d3b1 |
15 | 409907e13bd |
hex | 21ec7061d2f |
2331211341103 has 4 divisors (see below), whose sum is σ = 2331613210608. Its totient is φ = 2330809471600.
The previous prime is 2331211341097. The next prime is 2331211341119. The reversal of 2331211341103 is 3011431121332.
2331211341103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2331211341103 - 241 = 132188085551 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 (2331211341163) 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, 200926051 + ... + 200937652.
It is an arithmetic number, because the mean of its divisors is an integer number (582903302652).
Almost surely, 22331211341103 is an apocalyptic number.
2331211341103 is a deficient number, since it is larger than the sum of its proper divisors (401869505).
2331211341103 is an equidigital number, since it uses as much as digits as its factorization.
2331211341103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401869504.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 2331211341103 its reverse (3011431121332), we get a palindrome (5342642462435).
The spelling of 2331211341103 in words is "two trillion, three hundred thirty-one billion, two hundred eleven million, three hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •