Base | Representation |
---|---|
bin | 101101010010011011001… |
… | …100110101011100011101 |
3 | 102000112000210101111222112 |
4 | 231102123030311130131 |
5 | 401442200444433141 |
6 | 10341412344523405 |
7 | 440563141563542 |
oct | 55223314653435 |
9 | 12015023344875 |
10 | 3112160155421 |
11 | a9a9503015a9 |
12 | 4231a8180565 |
13 | 19762471a585 |
14 | aa8b4d44bc9 |
15 | 55e4b2d77eb |
hex | 2d49b33571d |
3112160155421 has 8 divisors (see below), whose sum is σ = 3234781903584. Its totient is φ = 2991565213200.
The previous prime is 3112160155399. The next prime is 3112160155439. The reversal of 3112160155421 is 1245510612113.
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 3112160155421 - 230 = 3111086413597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3112160155451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506698355 + ... + 506704496.
It is an arithmetic number, because the mean of its divisors is an integer number (404347737948).
Almost surely, 23112160155421 is an apocalyptic number.
It is an amenable number.
3112160155421 is a deficient number, since it is larger than the sum of its proper divisors (122621748163).
3112160155421 is a wasteful number, since it uses less digits than its factorization.
3112160155421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013402971.
The product of its (nonzero) digits is 7200, while the sum is 32.
Adding to 3112160155421 its reverse (1245510612113), we get a palindrome (4357670767534).
The spelling of 3112160155421 in words is "three trillion, one hundred twelve billion, one hundred sixty million, one hundred fifty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •