Base | Representation |
---|---|
bin | 1110001101000000011011… |
… | …01001010001111001011100 |
3 | 11002120212102120120201212210 |
4 | 13012200031221101321130 |
5 | 13043211124130222112 |
6 | 150232203121400420 |
7 | 6402345403655205 |
oct | 706401551217134 |
9 | 132525376521783 |
10 | 31233231101532 |
11 | 9a51a36787619 |
12 | 3605261a99110 |
13 | 145738662a035 |
14 | 79d9a70c25ac |
15 | 3926ac0d1b3c |
hex | 1c680da51e5c |
31233231101532 has 12 divisors (see below), whose sum is σ = 72877539236936. Its totient is φ = 10411077033840.
The previous prime is 31233231101461. The next prime is 31233231101537. The reversal of 31233231101532 is 23510113233213.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 31233231101532.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31233231101537) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1301384629219 + ... + 1301384629242.
Almost surely, 231233231101532 is an apocalyptic number.
It is an amenable number.
31233231101532 is an abundant number, since it is smaller than the sum of its proper divisors (41644308135404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31233231101532 is a wasteful number, since it uses less digits than its factorization.
31233231101532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602769258468 (or 2602769258466 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 31233231101532 its reverse (23510113233213), we get a palindrome (54743344334745).
The spelling of 31233231101532 in words is "thirty-one trillion, two hundred thirty-three billion, two hundred thirty-one million, one hundred one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •