Base | Representation |
---|---|
bin | 100010000101101000… |
… | …1101110100101110111 |
3 | 20222221200120020201200 |
4 | 1010023101232211313 |
5 | 2144410113000240 |
6 | 53343532023543 |
7 | 5201024451663 |
oct | 1041321564567 |
9 | 228850506650 |
10 | 73203640695 |
11 | 29055601809 |
12 | 1222b901bb3 |
13 | 6b9808c333 |
14 | 37862ab8a3 |
15 | 1d869cc930 |
hex | 110b46e977 |
73203640695 has 48 divisors (see below), whose sum is σ = 127273835520. Its totient is φ = 38922916032.
The previous prime is 73203640693. The next prime is 73203640711. The reversal of 73203640695 is 59604630237.
It is not a de Polignac number, because 73203640695 - 21 = 73203640693 is a prime.
It is a super-2 number, since 2×732036406952 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 73203640695.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73203640693) 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 47 ways as a sum of consecutive naturals, for example, 25008322 + ... + 25011248.
It is an arithmetic number, because the mean of its divisors is an integer number (2651538240).
Almost surely, 273203640695 is an apocalyptic number.
73203640695 is a deficient number, since it is larger than the sum of its proper divisors (54070194825).
73203640695 is a wasteful number, since it uses less digits than its factorization.
73203640695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4444 (or 4441 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 45.
The spelling of 73203640695 in words is "seventy-three billion, two hundred three million, six hundred forty thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •