Base | Representation |
---|---|
bin | 1001001011001001010… |
… | …01100010001011111101 |
3 | 1010010122022100020011022 |
4 | 10211210221202023331 |
5 | 20131033113102031 |
6 | 400451032433525 |
7 | 31526322115310 |
oct | 4454451421375 |
9 | 1103568306138 |
10 | 315221222141 |
11 | 111759186831 |
12 | 51112b488a5 |
13 | 23957452727 |
14 | 113848b0977 |
15 | 82edb2097b |
hex | 4964a622fd |
315221222141 has 24 divisors (see below), whose sum is σ = 380527560000. Its totient is φ = 255756289536.
The previous prime is 315221222119. The next prime is 315221222143. The reversal of 315221222141 is 141222122513.
It is a de Polignac number, because none of the positive numbers 2k-315221222141 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 315221222141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315221222143) 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 23 ways as a sum of consecutive naturals, for example, 3024110 + ... + 3126608.
It is an arithmetic number, because the mean of its divisors is an integer number (15855315000).
Almost surely, 2315221222141 is an apocalyptic number.
It is an amenable number.
315221222141 is a deficient number, since it is larger than the sum of its proper divisors (65306337859).
315221222141 is a wasteful number, since it uses less digits than its factorization.
315221222141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103761 (or 103742 counting only the distinct ones).
The product of its digits is 1920, while the sum is 26.
Adding to 315221222141 its reverse (141222122513), we get a palindrome (456443344654).
The spelling of 315221222141 in words is "three hundred fifteen billion, two hundred twenty-one million, two hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •