Base | Representation |
---|---|
bin | 11110100110100101011… |
… | …011000100001100001010 |
3 | 21110001020200111201001012 |
4 | 132212211123010030022 |
5 | 233423433132442214 |
6 | 4250040023523522 |
7 | 304636440655604 |
oct | 36464533041412 |
9 | 7401220451035 |
10 | 2103014343434 |
11 | 740979853804 |
12 | 29b6b32b95a2 |
13 | 12340c70ab84 |
14 | 73b01dac174 |
15 | 39a86b9103e |
hex | 1e9a56c430a |
2103014343434 has 4 divisors (see below), whose sum is σ = 3154521515154. Its totient is φ = 1051507171716.
The previous prime is 2103014343431. The next prime is 2103014343511. The reversal of 2103014343434 is 4343434103012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1697035106209 + 405979237225 = 1302703^2 + 637165^2 .
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 2103014343434.
It is not an unprimeable number, because it can be changed into a prime (2103014343431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525753585857 + ... + 525753585860.
Almost surely, 22103014343434 is an apocalyptic number.
2103014343434 is a deficient number, since it is larger than the sum of its proper divisors (1051507171720).
2103014343434 is a wasteful number, since it uses less digits than its factorization.
2103014343434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051507171719.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 2103014343434 its reverse (4343434103012), we get a palindrome (6446448446446).
The spelling of 2103014343434 in words is "two trillion, one hundred three billion, fourteen million, three hundred forty-three thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •