Base | Representation |
---|---|
bin | 11011100111011… |
… | …00010001010000 |
3 | 121010220021012120 |
4 | 31303230101100 |
5 | 433300420410 |
6 | 34553054240 |
7 | 5512013331 |
oct | 1563542120 |
9 | 533807176 |
10 | 231654480 |
11 | 109843492 |
12 | 656b7380 |
13 | 38cbb375 |
14 | 22aa2288 |
15 | 1550d570 |
hex | dcec450 |
231654480 has 40 divisors (see below), whose sum is σ = 718129632. Its totient is φ = 61774464.
The previous prime is 231654463. The next prime is 231654487. The reversal of 231654480 is 84456132.
231654480 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a zygodrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231654487) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 482374 + ... + 482853.
Almost surely, 2231654480 is an apocalyptic number.
231654480 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231654480 is an abundant number, since it is smaller than the sum of its proper divisors (486475152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231654480 is a wasteful number, since it uses less digits than its factorization.
231654480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965243 (or 965237 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The square root of 231654480 is about 15220.1997358773. The cubic root of 231654480 is about 614.1581713622.
The spelling of 231654480 in words is "two hundred thirty-one million, six hundred fifty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •