Base | Representation |
---|---|
bin | 100001110000001001… |
… | …1101111100011010111 |
3 | 20221002110002010201121 |
4 | 1003200103233203113 |
5 | 2141421040424011 |
6 | 53144220504411 |
7 | 5144122124566 |
oct | 1034023574327 |
9 | 227073063647 |
10 | 72482748631 |
11 | 28815692947 |
12 | 1206a3ab107 |
13 | 6ab1916797 |
14 | 3718655bdd |
15 | 1d4357ee71 |
hex | 10e04ef8d7 |
72482748631 has 4 divisors (see below), whose sum is σ = 74168393992. Its totient is φ = 70797103272.
The previous prime is 72482748601. The next prime is 72482748697. The reversal of 72482748631 is 13684728427.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13684728427 = 1361 ⋅10054907.
It is a cyclic number.
It is not a de Polignac number, because 72482748631 - 25 = 72482748599 is a prime.
It is a super-2 number, since 2×724827486312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72482748601) 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 3 ways as a sum of consecutive naturals, for example, 842822616 + ... + 842822701.
It is an arithmetic number, because the mean of its divisors is an integer number (18542098498).
Almost surely, 272482748631 is an apocalyptic number.
72482748631 is a deficient number, since it is larger than the sum of its proper divisors (1685645361).
72482748631 is a wasteful number, since it uses less digits than its factorization.
72482748631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685645360.
The product of its digits is 3612672, while the sum is 52.
The spelling of 72482748631 in words is "seventy-two billion, four hundred eighty-two million, seven hundred forty-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •