Base | Representation |
---|---|
bin | 101101110001001010010… |
… | …011010111010111111011 |
3 | 102010200012210102000011110 |
4 | 231301022103113113323 |
5 | 403012243114314011 |
6 | 10404511234531403 |
7 | 443142030301314 |
oct | 55611223272773 |
9 | 12120183360143 |
10 | 3145162651131 |
11 | 1002946360046 |
12 | 429678736b63 |
13 | 19a783b5bb47 |
14 | ac32604560b |
15 | 56c2d7e9ba6 |
hex | 2dc4a4d75fb |
3145162651131 has 4 divisors (see below), whose sum is σ = 4193550201512. Its totient is φ = 2096775100752.
The previous prime is 3145162651117. The next prime is 3145162651151. The reversal of 3145162651131 is 1311562615413.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3145162651131 - 27 = 3145162651003 is a prime.
It is a super-3 number, since 3×31451626511313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 3145162651131.
It is not an unprimeable number, because it can be changed into a prime (3145162651151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 524193775186 + ... + 524193775191.
It is an arithmetic number, because the mean of its divisors is an integer number (1048387550378).
Almost surely, 23145162651131 is an apocalyptic number.
3145162651131 is a deficient number, since it is larger than the sum of its proper divisors (1048387550381).
3145162651131 is a wasteful number, since it uses less digits than its factorization.
3145162651131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1048387550380.
The product of its digits is 64800, while the sum is 39.
The spelling of 3145162651131 in words is "three trillion, one hundred forty-five billion, one hundred sixty-two million, six hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •