Base | Representation |
---|---|
bin | 1001001001100100110110… |
… | …01110101100000000101111 |
3 | 2122020110211111112220100020 |
4 | 10210302123032230000233 |
5 | 10114122213132230411 |
6 | 110443035004333223 |
7 | 4144432040550045 |
oct | 444623316540057 |
9 | 78213744486306 |
10 | 20120231133231 |
11 | 6457a3aa39a59 |
12 | 230b528844213 |
13 | b2c439336118 |
14 | 4d7b7816c395 |
15 | 24d590295606 |
hex | 124c9b3ac02f |
20120231133231 has 8 divisors (see below), whose sum is σ = 26863573721520. Its totient is φ = 13395187983552.
The previous prime is 20120231133193. The next prime is 20120231133293. The reversal of 20120231133231 is 13233113202102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20120231133231 - 234 = 20103051264047 is a prime.
It is a super-2 number, since 2×201202311332312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120231133031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4574857086 + ... + 4574861483.
It is an arithmetic number, because the mean of its divisors is an integer number (3357946715190).
Almost surely, 220120231133231 is an apocalyptic number.
20120231133231 is a deficient number, since it is larger than the sum of its proper divisors (6743342588289).
20120231133231 is an equidigital number, since it uses as much as digits as its factorization.
20120231133231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9149719305.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 20120231133231 its reverse (13233113202102), we get a palindrome (33353344335333).
The spelling of 20120231133231 in words is "twenty trillion, one hundred twenty billion, two hundred thirty-one million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •