Base | Representation |
---|---|
bin | 10101100010101110… |
… | …010001000001100000 |
3 | 2012201001022020212121 |
4 | 111202232101001200 |
5 | 334333032211000 |
6 | 14343140234024 |
7 | 1446132243424 |
oct | 254256210140 |
9 | 65631266777 |
10 | 23131132000 |
11 | 989aa14919 |
12 | 459669b914 |
13 | 22482b2c72 |
14 | 11960a4b84 |
15 | 905ab3b1a |
hex | 562b91060 |
23131132000 has 96 divisors (see below), whose sum is σ = 59824608480. Its totient is φ = 8765452800.
The previous prime is 23131131997. The next prime is 23131132001. The reversal of 23131132000 is 23113132.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23131132001) 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 15 ways as a sum of consecutive naturals, for example, 76179 + ... + 228178.
It is an arithmetic number, because the mean of its divisors is an integer number (623173005).
Almost surely, 223131132000 is an apocalyptic number.
23131132000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23131132000 is an abundant number, since it is smaller than the sum of its proper divisors (36693476480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23131132000 is a wasteful number, since it uses less digits than its factorization.
23131132000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304401 (or 304383 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 23131132000 its reverse (23113132), we get a palindrome (23154245132).
The spelling of 23131132000 in words is "twenty-three billion, one hundred thirty-one million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •