Base | Representation |
---|---|
bin | 1011000010110000111000… |
… | …1010011011101011011111 |
3 | 1120222202220112102022010010 |
4 | 2300230032022123223133 |
5 | 3042414020200133011 |
6 | 41454001452014303 |
7 | 2362144544320362 |
oct | 260541612335337 |
9 | 46882815368103 |
10 | 12142110161631 |
11 | 396149270767a |
12 | 1441280161393 |
13 | 6a0cc44b9a18 |
14 | 2dd9775800d9 |
15 | 160c9e0151a6 |
hex | b0b0e29badf |
12142110161631 has 8 divisors (see below), whose sum is σ = 16189499871664. Its totient is φ = 8094730279680.
The previous prime is 12142110161539. The next prime is 12142110161639. The reversal of 12142110161631 is 13616101124121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12142110161631 - 241 = 9943086906079 is a prime.
It is a super-2 number, since 2×121421101616312 (a number of 27 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 (12142110161639) 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, 1205721 + ... + 5073261.
It is an arithmetic number, because the mean of its divisors is an integer number (2023687483958).
Almost surely, 212142110161631 is an apocalyptic number.
12142110161631 is a deficient number, since it is larger than the sum of its proper divisors (4047389710033).
12142110161631 is a wasteful number, since it uses less digits than its factorization.
12142110161631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4914041.
The product of its (nonzero) digits is 1728, while the sum is 30.
Adding to 12142110161631 its reverse (13616101124121), we get a palindrome (25758211285752).
The spelling of 12142110161631 in words is "twelve trillion, one hundred forty-two billion, one hundred ten million, one hundred sixty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •