Base | Representation |
---|---|
bin | 11011100101000… |
… | …00101110110000 |
3 | 121010022112210000 |
4 | 31302200232300 |
5 | 433211020242 |
6 | 34542310000 |
7 | 5506254300 |
oct | 1562405660 |
9 | 533275700 |
10 | 231345072 |
11 | 109651a82 |
12 | 65588300 |
13 | 38c1059a |
14 | 22a21600 |
15 | 1549ba4c |
hex | dca0bb0 |
231345072 has 150 divisors (see below), whose sum is σ = 779112708. Its totient is φ = 66080448.
The previous prime is 231345043. The next prime is 231345089. The reversal of 231345072 is 270543132.
231345072 is a `hidden beast` number, since 23 + 134 + 507 + 2 = 666.
It is a super-4 number, since 4×2313450724 (a number of 35 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 61683 + ... + 65325.
Almost surely, 2231345072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 231345072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (389556354).
231345072 is an abundant number, since it is smaller than the sum of its proper divisors (547767636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231345072 is a wasteful number, since it uses less digits than its factorization.
231345072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677 (or 3655 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 231345072 is about 15210.0319526292. The cubic root of 231345072 is about 613.8846172361.
The spelling of 231345072 in words is "two hundred thirty-one million, three hundred forty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •