Base | Representation |
---|---|
bin | 100001110010101000… |
… | …1010111101100001001 |
3 | 20221022020202101112022 |
4 | 1003211101113230021 |
5 | 2142103344401211 |
6 | 53200353254225 |
7 | 5146152634121 |
oct | 1034521275411 |
9 | 227266671468 |
10 | 72566012681 |
11 | 28858693408 |
12 | 12092264375 |
13 | 6ac5c4a756 |
14 | 372572bc81 |
15 | 1d4aa2abdb |
hex | 10e5457b09 |
72566012681 has 4 divisors (see below), whose sum is σ = 72566826000. Its totient is φ = 72565199364.
The previous prime is 72566012669. The next prime is 72566012683. The reversal of 72566012681 is 18621066527.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 72566012681 - 222 = 72561818377 is a prime.
It is a super-2 number, since 2×725660126812 (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 (72566012683) 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, 253631 + ... + 457668.
It is an arithmetic number, because the mean of its divisors is an integer number (18141706500).
Almost surely, 272566012681 is an apocalyptic number.
It is an amenable number.
72566012681 is a deficient number, since it is larger than the sum of its proper divisors (813319).
72566012681 is a wasteful number, since it uses less digits than its factorization.
72566012681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813318.
The product of its (nonzero) digits is 241920, while the sum is 44.
The spelling of 72566012681 in words is "seventy-two billion, five hundred sixty-six million, twelve thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •