Base | Representation |
---|---|
bin | 100100111101011… |
… | …0001010011111111 |
3 | 10012102112210112001 |
4 | 1021322301103333 |
5 | 10014434034403 |
6 | 323020323131 |
7 | 42506020363 |
oct | 11172612377 |
9 | 3172483461 |
10 | 1240143103 |
11 | 587034961 |
12 | 2a73a34a7 |
13 | 169c0b1b4 |
14 | ba9bd2a3 |
15 | 73d19c1d |
hex | 49eb14ff |
1240143103 has 4 divisors (see below), whose sum is σ = 1241773488. Its totient is φ = 1238512720.
The previous prime is 1240143101. The next prime is 1240143109. The reversal of 1240143103 is 3013410421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3013410421 = 7 ⋅430487203.
It is a cyclic number.
It is not a de Polignac number, because 1240143103 - 21 = 1240143101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1240143101) 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 in 3 ways as a sum of consecutive naturals, for example, 814051 + ... + 815572.
It is an arithmetic number, because the mean of its divisors is an integer number (310443372).
Almost surely, 21240143103 is an apocalyptic number.
1240143103 is a deficient number, since it is larger than the sum of its proper divisors (1630385).
1240143103 is an equidigital number, since it uses as much as digits as its factorization.
1240143103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1630384.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1240143103 is about 35215.6655907566. The cubic root of 1240143103 is about 1074.3783975868.
Adding to 1240143103 its reverse (3013410421), we get a palindrome (4253553524).
The spelling of 1240143103 in words is "one billion, two hundred forty million, one hundred forty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •