Base | Representation |
---|---|
bin | 100001111100110010011… |
… | …010110100001101000111 |
3 | 22021000220200210202021121 |
4 | 201330302122310031013 |
5 | 301211002330211403 |
6 | 4543434344054411 |
7 | 330361145265103 |
oct | 41746232641507 |
9 | 8230820722247 |
10 | 2333013132103 |
11 | 81a475100935 |
12 | 3181a1464407 |
13 | 13c004a89974 |
14 | 80cc02a0903 |
15 | 40a48aa03bd |
hex | 21f326b4347 |
2333013132103 has 4 divisors (see below), whose sum is σ = 2333173018768. Its totient is φ = 2332853245440.
The previous prime is 2333013132091. The next prime is 2333013132137. The reversal of 2333013132103 is 3012313103332.
2333013132103 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 2333013132103 - 229 = 2332476261191 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 (2333013102103) 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, 79921443 + ... + 79950628.
It is an arithmetic number, because the mean of its divisors is an integer number (583293254692).
Almost surely, 22333013132103 is an apocalyptic number.
2333013132103 is a deficient number, since it is larger than the sum of its proper divisors (159886665).
2333013132103 is a wasteful number, since it uses less digits than its factorization.
2333013132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159886664.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 2333013132103 its reverse (3012313103332), we get a palindrome (5345326235435).
The spelling of 2333013132103 in words is "two trillion, three hundred thirty-three billion, thirteen million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •