Base | Representation |
---|---|
bin | 11110100110101011001… |
… | …101101111000100001110 |
3 | 21110001111110100101201100 |
4 | 132212223031233010032 |
5 | 233424133021343314 |
6 | 4250053414323530 |
7 | 304642030620060 |
oct | 36465315570416 |
9 | 7401443311640 |
10 | 2103111512334 |
11 | 740a19691188 |
12 | 29b71b9595a6 |
13 | 12342689cb71 |
14 | 73b10c63730 |
15 | 39a90486c09 |
hex | 1e9ab36f10e |
2103111512334 has 48 divisors (see below), whose sum is σ = 5514040273248. Its totient is φ = 565542590976.
The previous prime is 2103111512323. The next prime is 2103111512389. The reversal of 2103111512334 is 4332151113012.
2103111512334 is a `hidden beast` number, since 2 + 1 + 0 + 3 + 111 + 512 + 3 + 34 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 2103111512298 and 2103111512307.
It is a congruent number.
It is an unprimeable number.
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, 490920247 + ... + 490924530.
It is an arithmetic number, because the mean of its divisors is an integer number (114875839026).
Almost surely, 22103111512334 is an apocalyptic number.
2103111512334 is an abundant number, since it is smaller than the sum of its proper divisors (3410928760914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103111512334 is a wasteful number, since it uses less digits than its factorization.
2103111512334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981844809 (or 981844806 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 2103111512334 its reverse (4332151113012), we get a palindrome (6435262625346).
The spelling of 2103111512334 in words is "two trillion, one hundred three billion, one hundred eleven million, five hundred twelve thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •