Base | Representation |
---|---|
bin | 11101101110110010011… |
… | …011100011101100011110 |
3 | 21020022121100210212002000 |
4 | 131232302123203230132 |
5 | 231433233334043032 |
6 | 4202331044343130 |
7 | 300415666151442 |
oct | 35566233435436 |
9 | 7208540725060 |
10 | 2043103034142 |
11 | 718525443355 |
12 | 28bb730a4aa6 |
13 | 11a8824649c1 |
14 | 70c5b204822 |
15 | 3822c10be7c |
hex | 1dbb26e3b1e |
2043103034142 has 64 divisors (see below), whose sum is σ = 4561228800000. Its totient is φ = 677891528064.
The previous prime is 2043103034131. The next prime is 2043103034153. The reversal of 2043103034142 is 2414303013402.
2043103034142 is a `hidden beast` number, since 2 + 0 + 4 + 310 + 3 + 0 + 341 + 4 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (2043103034131) and next prime (2043103034153).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10221334 + ... + 10419302.
It is an arithmetic number, because the mean of its divisors is an integer number (71269200000).
Almost surely, 22043103034142 is an apocalyptic number.
2043103034142 is an abundant number, since it is smaller than the sum of its proper divisors (2518125765858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2043103034142 is a wasteful number, since it uses less digits than its factorization.
2043103034142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198862 (or 198856 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 2043103034142 its reverse (2414303013402), we get a palindrome (4457406047544).
The spelling of 2043103034142 in words is "two trillion, forty-three billion, one hundred three million, thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •