Base | Representation |
---|---|
bin | 11110100110101011010… |
… | …011110010110000101101 |
3 | 21110001111120100002001010 |
4 | 132212223103302300231 |
5 | 233424133423202313 |
6 | 4250053512335433 |
7 | 304642050252600 |
oct | 36465323626055 |
9 | 7401446302033 |
10 | 2103113100333 |
11 | 740a1a576283 |
12 | 29b7203a4579 |
13 | 1234270078cb |
14 | 73b11158337 |
15 | 39a9069c4c3 |
hex | 1e9ab4f2c2d |
2103113100333 has 24 divisors (see below), whose sum is σ = 3266747441568. Its totient is φ = 1200019298016.
The previous prime is 2103113100331. The next prime is 2103113100343. The reversal of 2103113100333 is 3330013113012.
It is not a de Polignac number, because 2103113100333 - 21 = 2103113100331 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103113100331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10373166 + ... + 10573967.
It is an arithmetic number, because the mean of its divisors is an integer number (136114476732).
Almost surely, 22103113100333 is an apocalyptic number.
It is an amenable number.
2103113100333 is a deficient number, since it is larger than the sum of its proper divisors (1163634341235).
2103113100333 is a wasteful number, since it uses less digits than its factorization.
2103113100333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20947833 (or 20947826 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 2103113100333 its reverse (3330013113012), we get a palindrome (5433126213345).
The spelling of 2103113100333 in words is "two trillion, one hundred three billion, one hundred thirteen million, one hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •