Base | Representation |
---|---|
bin | 1101011100101000001… |
… | …1111111100110000000 |
3 | 211002022102010011222112 |
4 | 3113022003333212000 |
5 | 12241113431424412 |
6 | 254044115154452 |
7 | 22455654513350 |
oct | 3271203774600 |
9 | 732272104875 |
10 | 231023311232 |
11 | 89a8170009a |
12 | 389352a5a28 |
13 | 18a296c3a7c |
14 | b2783c4b60 |
15 | 6021d36722 |
hex | 35ca0ff980 |
231023311232 has 32 divisors (see below), whose sum is σ = 525990576720. Its totient is φ = 99009990144.
The previous prime is 231023311229. The next prime is 231023311243. The reversal of 231023311232 is 232113320132.
231023311232 is digitally balanced in base 2, 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 (32).
It is a junction number, because it is equal to n+sod(n) for n = 231023311198 and 231023311207.
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 3 ways as a sum of consecutive naturals, for example, 128918363 + ... + 128920154.
Almost surely, 2231023311232 is an apocalyptic number.
It is an amenable number.
231023311232 is an abundant number, since it is smaller than the sum of its proper divisors (294967265488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231023311232 is an equidigital number, since it uses as much as digits as its factorization.
231023311232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257838538 (or 257838526 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 231023311232 its reverse (232113320132), we get a palindrome (463136631364).
The spelling of 231023311232 in words is "two hundred thirty-one billion, twenty-three million, three hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •