Base | Representation |
---|---|
bin | 10110110010000011… |
… | …10001011100100111 |
3 | 1011120101212222102100 |
4 | 23121001301130213 |
5 | 200022122231033 |
6 | 5341401543143 |
7 | 612045152616 |
oct | 133101613447 |
9 | 34511788370 |
10 | 12231055143 |
11 | 520712583a |
12 | 24541a4ab3 |
13 | 11cbca3148 |
14 | 8405a587d |
15 | 4b8bb1513 |
hex | 2d9071727 |
12231055143 has 24 divisors (see below), whose sum is σ = 17778683520. Its totient is φ = 8102595600.
The previous prime is 12231055099. The next prime is 12231055147. The reversal of 12231055143 is 34155013221.
12231055143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12231055143 - 214 = 12231038759 is a prime.
It is a super-2 number, since 2×122310551432 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12231055147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4288668 + ... + 4291518.
It is an arithmetic number, because the mean of its divisors is an integer number (740778480).
Almost surely, 212231055143 is an apocalyptic number.
12231055143 is a deficient number, since it is larger than the sum of its proper divisors (5547628377).
12231055143 is a wasteful number, since it uses less digits than its factorization.
12231055143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5699 (or 5696 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 12231055143 its reverse (34155013221), we get a palindrome (46386068364).
The spelling of 12231055143 in words is "twelve billion, two hundred thirty-one million, fifty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •