Base | Representation |
---|---|
bin | 110011010000101… |
… | …1011011010001101 |
3 | 11102212120001000010 |
4 | 1212201123122031 |
5 | 12010312222203 |
6 | 442402223433 |
7 | 60424043055 |
oct | 14641333215 |
9 | 4385501003 |
10 | 1720039053 |
11 | 802a0a887 |
12 | 400054b79 |
13 | 2154746b5 |
14 | 124620565 |
15 | a1011303 |
hex | 6685b68d |
1720039053 has 4 divisors (see below), whose sum is σ = 2293385408. Its totient is φ = 1146692700.
The previous prime is 1720039043. The next prime is 1720039099. The reversal of 1720039053 is 3509300271.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3509300271 = 3 ⋅1169766757.
It is not a de Polignac number, because 1720039053 - 212 = 1720034957 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 1720039053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1720039033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 286673173 + ... + 286673178.
It is an arithmetic number, because the mean of its divisors is an integer number (573346352).
Almost surely, 21720039053 is an apocalyptic number.
It is an amenable number.
1720039053 is a deficient number, since it is larger than the sum of its proper divisors (573346355).
1720039053 is an equidigital number, since it uses as much as digits as its factorization.
1720039053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 573346354.
The product of its (nonzero) digits is 5670, while the sum is 30.
The square root of 1720039053 is about 41473.3535297063. The cubic root of 1720039053 is about 1198.1543509662.
The spelling of 1720039053 in words is "one billion, seven hundred twenty million, thirty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •