Base | Representation |
---|---|
bin | 1101011101100001011… |
… | …1001110001001011000 |
3 | 211002221010120110020010 |
4 | 3113120113032021120 |
5 | 12242111341420400 |
6 | 254124005401520 |
7 | 22464630020511 |
oct | 3273027161130 |
9 | 732833513203 |
10 | 231263232600 |
11 | 8a09507a614 |
12 | 389a17092a0 |
13 | 18a67317b8a |
14 | b29c1d9a08 |
15 | 6037e29450 |
hex | 35d85ce258 |
231263232600 has 48 divisors (see below), whose sum is σ = 716916022920. Its totient is φ = 61670195200.
The previous prime is 231263232593. The next prime is 231263232623. The reversal of 231263232600 is 6232362132.
231263232600 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 (30).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 192718761 + ... + 192719960.
Almost surely, 2231263232600 is an apocalyptic number.
231263232600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231263232600 is an abundant number, since it is smaller than the sum of its proper divisors (485652790320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231263232600 is a wasteful number, since it uses less digits than its factorization.
231263232600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385438740 (or 385438731 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 231263232600 its reverse (6232362132), we get a palindrome (237495594732).
The spelling of 231263232600 in words is "two hundred thirty-one billion, two hundred sixty-three million, two hundred thirty-two thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •