Base | Representation |
---|---|
bin | 100000001111000001111… |
… | …001000111110000110011 |
3 | 21211202201101110221121211 |
4 | 200033001321013300303 |
5 | 242243122222243011 |
6 | 4413344142500551 |
7 | 316016520653221 |
oct | 40170171076063 |
9 | 7752641427554 |
10 | 2215161134131 |
11 | 784498790500 |
12 | 2b9390b94757 |
13 | 130b728c931a |
14 | 7930033bb11 |
15 | 3c94c494b21 |
hex | 203c1e47c33 |
2215161134131 has 24 divisors (see below), whose sum is σ = 2461289988080. Its totient is φ = 1991934996480.
The previous prime is 2215161134119. The next prime is 2215161134189. The reversal of 2215161134131 is 1314311615122.
It is a happy number.
It is not a de Polignac number, because 2215161134131 - 223 = 2215152745523 is a prime.
It is a super-2 number, since 2×22151611341312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2215161134093 and 2215161134102.
It is not an unprimeable number, because it can be changed into a prime (2215161134531) 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, 21862435 + ... + 21963523.
Almost surely, 22215161134131 is an apocalyptic number.
2215161134131 is a deficient number, since it is larger than the sum of its proper divisors (246128853949).
2215161134131 is a wasteful number, since it uses less digits than its factorization.
2215161134131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103075 (or 103064 counting only the distinct ones).
The product of its digits is 4320, while the sum is 31.
Adding to 2215161134131 its reverse (1314311615122), we get a palindrome (3529472749253).
The spelling of 2215161134131 in words is "two trillion, two hundred fifteen billion, one hundred sixty-one million, one hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •