Base | Representation |
---|---|
bin | 111101110010100… |
… | …0100000010100001 |
3 | 12100111022020100201 |
4 | 1323211010002201 |
5 | 13221232012231 |
6 | 541422145201 |
7 | 102243605413 |
oct | 17345040241 |
9 | 5314266321 |
10 | 2073313441 |
11 | 974371091 |
12 | 49a422201 |
13 | 2707060b4 |
14 | 1595009b3 |
15 | c2045161 |
hex | 7b9440a1 |
2073313441 has 4 divisors (see below), whose sum is σ = 2076518592. Its totient is φ = 2070108292.
The previous prime is 2073313439. The next prime is 2073313579. The reversal of 2073313441 is 1443133702.
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: 1443133702 = 2 ⋅721566851.
It is a cyclic number.
It is not a de Polignac number, because 2073313441 - 21 = 2073313439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2079313441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1601605 + ... + 1602898.
It is an arithmetic number, because the mean of its divisors is an integer number (519129648).
Almost surely, 22073313441 is an apocalyptic number.
It is an amenable number.
2073313441 is a deficient number, since it is larger than the sum of its proper divisors (3205151).
2073313441 is an equidigital number, since it uses as much as digits as its factorization.
2073313441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3205150.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 2073313441 is about 45533.6517424201. The cubic root of 2073313441 is about 1275.1315391138.
The spelling of 2073313441 in words is "two billion, seventy-three million, three hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •