Base | Representation |
---|---|
bin | 11110100110110111101… |
… | …001011111000100100011 |
3 | 21110002000222212102122100 |
4 | 132212313221133010203 |
5 | 233430044422112233 |
6 | 4250130225341443 |
7 | 304650142656423 |
oct | 36466751370443 |
9 | 7402028772570 |
10 | 2103320113443 |
11 | 74101640929a |
12 | 29b779797883 |
13 | 12345ab79083 |
14 | 73b30844483 |
15 | 39aa393e813 |
hex | 1e9b7a5f123 |
2103320113443 has 12 divisors (see below), whose sum is σ = 3038600237400. Its totient is φ = 1401995939136.
The previous prime is 2103320113439. The next prime is 2103320113459. The reversal of 2103320113443 is 3443110233012.
It is a happy number.
2103320113443 is a `hidden beast` number, since 2 + 1 + 0 + 3 + 3 + 201 + 13 + 443 = 666.
It is not a de Polignac number, because 2103320113443 - 22 = 2103320113439 is a prime.
It is a super-2 number, since 2×21033201134432 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2103320113483) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18061221 + ... + 18177302.
It is an arithmetic number, because the mean of its divisors is an integer number (253216686450).
Almost surely, 22103320113443 is an apocalyptic number.
2103320113443 is a deficient number, since it is larger than the sum of its proper divisors (935280123957).
2103320113443 is a wasteful number, since it uses less digits than its factorization.
2103320113443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36244978 (or 36244975 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 2103320113443 its reverse (3443110233012), we get a palindrome (5546430346455).
The spelling of 2103320113443 in words is "two trillion, one hundred three billion, three hundred twenty million, one hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •