Base | Representation |
---|---|
bin | 100101000010001… |
… | …1101111010101111 |
3 | 10012121022221111012 |
4 | 1022010131322233 |
5 | 10021111410403 |
6 | 323151015435 |
7 | 42536435432 |
oct | 11204357257 |
9 | 3177287435 |
10 | 1242685103 |
11 | 588510790 |
12 | 2a820a57b |
13 | 16a5bb23a |
14 | bb081819 |
15 | 7416ced8 |
hex | 4a11deaf |
1242685103 has 8 divisors (see below), whose sum is σ = 1355913216. Its totient is φ = 1129499800.
The previous prime is 1242685099. The next prime is 1242685109. The reversal of 1242685103 is 3015862421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1242685103 - 22 = 1242685099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1242685103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1242685109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98450 + ... + 110352.
It is an arithmetic number, because the mean of its divisors is an integer number (169489152).
Almost surely, 21242685103 is an apocalyptic number.
1242685103 is a deficient number, since it is larger than the sum of its proper divisors (113228113).
1242685103 is a wasteful number, since it uses less digits than its factorization.
1242685103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21405.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 1242685103 is about 35251.7390067497. The cubic root of 1242685103 is about 1075.1119704534. Note that the first 3 decimals are identical.
The spelling of 1242685103 in words is "one billion, two hundred forty-two million, six hundred eighty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •