Base | Representation |
---|---|
bin | 100010001011111010… |
… | …1000110110010011101 |
3 | 21000111100211212122011 |
4 | 1010113311012302131 |
5 | 2200323021211222 |
6 | 53420453551221 |
7 | 5206162520215 |
oct | 1042765066235 |
9 | 230440755564 |
10 | 73414241437 |
11 | 29153475209 |
12 | 1228a345511 |
13 | 6bcc8b8764 |
14 | 37a624d245 |
15 | 1d9a22cc77 |
hex | 1117d46c9d |
73414241437 has 4 divisors (see below), whose sum is σ = 73528416640. Its totient is φ = 73300066236.
The previous prime is 73414241431. The next prime is 73414241603.
73414241437 is nontrivially palindromic in base 10.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-73414241437 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 73414241437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73414241431) 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, 57086637 + ... + 57087922.
It is an arithmetic number, because the mean of its divisors is an integer number (18382104160).
Almost surely, 273414241437 is an apocalyptic number.
It is an amenable number.
73414241437 is a deficient number, since it is larger than the sum of its proper divisors (114175203).
73414241437 is a wasteful number, since it uses less digits than its factorization.
73414241437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114175202.
The product of its digits is 225792, while the sum is 40.
The spelling of 73414241437 in words is "seventy-three billion, four hundred fourteen million, two hundred forty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •