Base | Representation |
---|---|
bin | 100010000010100001… |
… | …1110011010100000001 |
3 | 20222200102021112212011 |
4 | 1010011003303110001 |
5 | 2144201411423341 |
6 | 53325324132521 |
7 | 5165320011421 |
oct | 1040503632401 |
9 | 228612245764 |
10 | 73099326721 |
11 | 29001734113 |
12 | 12200997141 |
13 | 6b7c5980a5 |
14 | 37764b6481 |
15 | 1d7c774b81 |
hex | 11050f3501 |
73099326721 has 4 divisors (see below), whose sum is σ = 73371071700. Its totient is φ = 72827581744.
The previous prime is 73099326683. The next prime is 73099326739. The reversal of 73099326721 is 12762399037.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 32198713600 + 40900613121 = 179440^2 + 202239^2 .
It is a cyclic number.
It is not a de Polignac number, because 73099326721 - 223 = 73090938113 is a prime.
It is a super-2 number, since 2×730993267212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (73099326121) 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, 135872086 + ... + 135872623.
It is an arithmetic number, because the mean of its divisors is an integer number (18342767925).
Almost surely, 273099326721 is an apocalyptic number.
It is an amenable number.
73099326721 is a deficient number, since it is larger than the sum of its proper divisors (271744979).
73099326721 is a wasteful number, since it uses less digits than its factorization.
73099326721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271744978.
The product of its (nonzero) digits is 857304, while the sum is 49.
The spelling of 73099326721 in words is "seventy-three billion, ninety-nine million, three hundred twenty-six thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •