Base | Representation |
---|---|
bin | 100001110111110110… |
… | …0111110111111000001 |
3 | 20221202110001212111012 |
4 | 1003233230332333001 |
5 | 2142433200224211 |
6 | 53230004330305 |
7 | 5153406333224 |
oct | 1035754767701 |
9 | 227673055435 |
10 | 72741023681 |
11 | 289384587a7 |
12 | 121209a3995 |
13 | 6b23295861 |
14 | 3740a875bb |
15 | 1d5b09ad8b |
hex | 10efb3efc1 |
72741023681 has 8 divisors (see below), whose sum is σ = 74734881960. Its totient is φ = 70748633088.
The previous prime is 72741023653. The next prime is 72741023683. The reversal of 72741023681 is 18632014727.
It can be written as a sum of positive squares in 4 ways, for example, as 14014771456 + 58726252225 = 118384^2 + 242335^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 72741023681 - 218 = 72740761537 is a prime.
It is a super-2 number, since 2×727410236812 (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 (72741023683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 266066 + ... + 465051.
It is an arithmetic number, because the mean of its divisors is an integer number (9341860245).
Almost surely, 272741023681 is an apocalyptic number.
It is an amenable number.
72741023681 is a deficient number, since it is larger than the sum of its proper divisors (1993858279).
72741023681 is a wasteful number, since it uses less digits than its factorization.
72741023681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733843.
The product of its (nonzero) digits is 112896, while the sum is 41.
The spelling of 72741023681 in words is "seventy-two billion, seven hundred forty-one million, twenty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •