Base | Representation |
---|---|
bin | 10110111100111100… |
… | …10100010101001101 |
3 | 1011210202211000010022 |
4 | 23132132110111031 |
5 | 200214020033031 |
6 | 5354424151525 |
7 | 614234606546 |
oct | 133636242515 |
9 | 34722730108 |
10 | 12322424141 |
11 | 5253761705 |
12 | 247a9085a5 |
13 | 1214bb4241 |
14 | 84c78b4cd |
15 | 4c1c0d97b |
hex | 2de79454d |
12322424141 has 8 divisors (see below), whose sum is σ = 12998997120. Its totient is φ = 11648653632.
The previous prime is 12322424123. The next prime is 12322424161. The reversal of 12322424141 is 14142422321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12322424141 - 210 = 12322423117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12322424141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12322424111) 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, 691580 + ... + 709173.
It is an arithmetic number, because the mean of its divisors is an integer number (1624874640).
Almost surely, 212322424141 is an apocalyptic number.
It is an amenable number.
12322424141 is a deficient number, since it is larger than the sum of its proper divisors (676572979).
12322424141 is a wasteful number, since it uses less digits than its factorization.
12322424141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401235.
The product of its digits is 3072, while the sum is 26.
Adding to 12322424141 its reverse (14142422321), we get a palindrome (26464846462).
The spelling of 12322424141 in words is "twelve billion, three hundred twenty-two million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •