Base | Representation |
---|---|
bin | 100001111110110010… |
… | …0100010001001011001 |
3 | 20222100122212111220021 |
4 | 1003331210202021121 |
5 | 2143422231030213 |
6 | 53305035230441 |
7 | 5162233061101 |
oct | 1037544421131 |
9 | 228318774807 |
10 | 72973689433 |
11 | 28a47821a47 |
12 | 121868a8421 |
13 | 6b5c5492b8 |
14 | 3763930201 |
15 | 1d71708d8d |
hex | 10fd922259 |
72973689433 has 4 divisors (see below), whose sum is σ = 73015605988. Its totient is φ = 72931772880.
The previous prime is 72973689431. The next prime is 72973689457. The reversal of 72973689433 is 33498637927.
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 713798089 + 72259891344 = 26717^2 + 268812^2 .
It is a cyclic number.
It is not a de Polignac number, because 72973689433 - 21 = 72973689431 is a prime.
It is a super-2 number, since 2×729736894332 (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 (72973689431) 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 3 ways as a sum of consecutive naturals, for example, 20955666 + ... + 20959147.
It is an arithmetic number, because the mean of its divisors is an integer number (18253901497).
Almost surely, 272973689433 is an apocalyptic number.
It is an amenable number.
72973689433 is a deficient number, since it is larger than the sum of its proper divisors (41916555).
72973689433 is a wasteful number, since it uses less digits than its factorization.
72973689433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41916554.
The product of its digits is 41150592, while the sum is 61.
The spelling of 72973689433 in words is "seventy-two billion, nine hundred seventy-three million, six hundred eighty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •