Base | Representation |
---|---|
bin | 10110100111110110… |
… | …01001001000111101 |
3 | 1011100102202211022112 |
4 | 23103323021020331 |
5 | 144333212243401 |
6 | 5325102423405 |
7 | 606655314056 |
oct | 132373111075 |
9 | 34312684275 |
10 | 12145431101 |
11 | 5172863171 |
12 | 242b591b65 |
13 | 11b7323c2b |
14 | 83307772d |
15 | 4b13eb3bb |
hex | 2d3ec923d |
12145431101 has 8 divisors (see below), whose sum is σ = 12565476000. Its totient is φ = 11725468720.
The previous prime is 12145431073. The next prime is 12145431127. The reversal of 12145431101 is 10113454121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12145431101 is a prime.
It is a super-2 number, since 2×121454311012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12145431301) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 514250 + ... + 537348.
It is an arithmetic number, because the mean of its divisors is an integer number (1570684500).
Almost surely, 212145431101 is an apocalyptic number.
It is an amenable number.
12145431101 is a deficient number, since it is larger than the sum of its proper divisors (420044899).
12145431101 is a wasteful number, since it uses less digits than its factorization.
12145431101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41259.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 12145431101 its reverse (10113454121), we get a palindrome (22258885222).
The spelling of 12145431101 in words is "twelve billion, one hundred forty-five million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •