Base | Representation |
---|---|
bin | 101010111011111… |
… | …1111110011110011 |
3 | 10201102000022100122 |
4 | 1111313333303303 |
5 | 10422312231033 |
6 | 354544040455 |
7 | 50463052604 |
oct | 12567776363 |
9 | 3642008318 |
10 | 1440742643 |
11 | 67a2972aa |
12 | 34260312b |
13 | 19c645352 |
14 | d94b9dab |
15 | 86741a98 |
hex | 55dffcf3 |
1440742643 has 4 divisors (see below), whose sum is σ = 1445375568. Its totient is φ = 1436109720.
The previous prime is 1440742637. The next prime is 1440742651. The reversal of 1440742643 is 3462470441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3462470441 = 337 ⋅10274393.
It is a cyclic number.
It is not a de Polignac number, because 1440742643 - 24 = 1440742627 is a prime.
It is a super-3 number, since 3×14407426433 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1440742603) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2315996 + ... + 2316617.
It is an arithmetic number, because the mean of its divisors is an integer number (361343892).
Almost surely, 21440742643 is an apocalyptic number.
1440742643 is a deficient number, since it is larger than the sum of its proper divisors (4632925).
1440742643 is an equidigital number, since it uses as much as digits as its factorization.
1440742643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4632924.
The product of its (nonzero) digits is 64512, while the sum is 35.
The square root of 1440742643 is about 37957.1158414335. The cubic root of 1440742643 is about 1129.4373273559.
The spelling of 1440742643 in words is "one billion, four hundred forty million, seven hundred forty-two thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •