| Base | Representation |
|---|---|
| bin | 1101011101010010101… |
| … | …0001101100100110100 |
| 3 | 211002202210122220020200 |
| 4 | 3113110222031210310 |
| 5 | 12241444440232012 |
| 6 | 254113510000500 |
| 7 | 22463243641230 |
| oct | 3272452154464 |
| 9 | 732683586220 |
| 10 | 231201102132 |
| 11 | 8a062aa4020 |
| 12 | 38984946130 |
| 13 | 18a574a32a0 |
| 14 | b293c655c0 |
| 15 | 60327553dc |
| hex | 35d4a8d934 |
231201102132 has 576 divisors, whose sum is σ = 819828172800. Its totient is φ = 53002460160.
The previous prime is 231201102107. The next prime is 231201102133.
231201102132 is a `hidden beast` number, since 231 + 201 + 102 + 132 = 666.
231201102132 is nontrivially palindromic in base 10.
231201102132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231201102133) 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 191 ways as a sum of consecutive naturals, for example, 78665119 + ... + 78668057.
It is an arithmetic number, because the mean of its divisors is an integer number (1423312800).
Almost surely, 2231201102132 is an apocalyptic number.
231201102132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 231201102132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (409914086400).
231201102132 is an abundant number, since it is smaller than the sum of its proper divisors (588627070668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231201102132 is a wasteful number, since it uses less digits than its factorization.
231201102132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3076 (or 3071 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
It can be divided in two parts, 231201 and 102132, that added together give a palindrome (333333).
The spelling of 231201102132 in words is "two hundred thirty-one billion, two hundred one million, one hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •