Base | Representation |
---|---|
bin | 100001111100111000… |
… | …1011010011000000101 |
3 | 20222012012221112220110 |
4 | 1003321301122120011 |
5 | 2143304422102423 |
6 | 53254441223233 |
7 | 5160530256114 |
oct | 1037161323005 |
9 | 228165845813 |
10 | 72909956613 |
11 | 28a1485159a |
12 | 12169491b19 |
13 | 6b4c293280 |
14 | 375929dc7b |
15 | 1d6ad1a193 |
hex | 10f9c5a605 |
72909956613 has 8 divisors (see below), whose sum is σ = 104691219808. Its totient is φ = 44867665584.
The previous prime is 72909956611. The next prime is 72909956621. The reversal of 72909956613 is 31665990927.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 72909956613 - 21 = 72909956611 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72909956611) 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, 934742995 + ... + 934743072.
It is an arithmetic number, because the mean of its divisors is an integer number (13086402476).
Almost surely, 272909956613 is an apocalyptic number.
It is an amenable number.
72909956613 is a deficient number, since it is larger than the sum of its proper divisors (31781263195).
72909956613 is a wasteful number, since it uses less digits than its factorization.
72909956613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869486083.
The product of its (nonzero) digits is 5511240, while the sum is 57.
The spelling of 72909956613 in words is "seventy-two billion, nine hundred nine million, nine hundred fifty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •