Base | Representation |
---|---|
bin | 100010010101111001… |
… | …0111100100001010001 |
3 | 21001100201011112000201 |
4 | 1010223302330201101 |
5 | 2202014300010114 |
6 | 53514021415201 |
7 | 5220401010325 |
oct | 1045362744121 |
9 | 231321145021 |
10 | 73749219409 |
11 | 2930556a108 |
12 | 1236256a501 |
13 | 6c54112288 |
14 | 37d8929985 |
15 | 1db984a874 |
hex | 112bcbc851 |
73749219409 has 8 divisors (see below), whose sum is σ = 79991980488. Its totient is φ = 67718077440.
The previous prime is 73749219403. The next prime is 73749219413. The reversal of 73749219409 is 90491294737.
It can be written as a sum of positive squares in 4 ways, for example, as 25568969409 + 48180250000 = 159903^2 + 219500^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 73749219409 - 27 = 73749219281 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 73749219409.
It is not an unprimeable number, because it can be changed into a prime (73749219403) 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, 52904052 + ... + 52905445.
It is an arithmetic number, because the mean of its divisors is an integer number (9998997561).
Almost surely, 273749219409 is an apocalyptic number.
It is an amenable number.
73749219409 is a deficient number, since it is larger than the sum of its proper divisors (6242761079).
73749219409 is a wasteful number, since it uses less digits than its factorization.
73749219409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105809555.
The product of its (nonzero) digits is 3429216, while the sum is 55.
The spelling of 73749219409 in words is "seventy-three billion, seven hundred forty-nine million, two hundred nineteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •