Base | Representation |
---|---|
bin | 1000100111111… |
… | …10101001110111 |
3 | 12001010120101001 |
4 | 10103332221313 |
5 | 122010034411 |
6 | 11102344131 |
7 | 1535634646 |
oct | 423765167 |
9 | 161116331 |
10 | 72346231 |
11 | 37923881 |
12 | 2028b047 |
13 | 11cb0729 |
14 | 987335d |
15 | 6540dc1 |
hex | 44fea77 |
72346231 has 12 divisors (see below), whose sum is σ = 74889360. Its totient is φ = 69866720.
The previous prime is 72346229. The next prime is 72346259. The reversal of 72346231 is 13264327.
It is not a de Polignac number, because 72346231 - 21 = 72346229 is a prime.
It is a super-2 number, since 2×723462312 = 10467954279810722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 72346231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72346831) 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 11 ways as a sum of consecutive naturals, for example, 676080 + ... + 676186.
It is an arithmetic number, because the mean of its divisors is an integer number (6240780).
Almost surely, 272346231 is an apocalyptic number.
72346231 is a gapful number since it is divisible by the number (71) formed by its first and last digit.
72346231 is a deficient number, since it is larger than the sum of its proper divisors (2543129).
72346231 is an equidigital number, since it uses as much as digits as its factorization.
72346231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374 (or 267 counting only the distinct ones).
The product of its digits is 6048, while the sum is 28.
The square root of 72346231 is about 8505.6587634351. The cubic root of 72346231 is about 416.6825406930.
The spelling of 72346231 in words is "seventy-two million, three hundred forty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •