Base | Representation |
---|---|
bin | 1111001010101111… |
… | …00010111011010011 |
3 | 210000111201110112222 |
4 | 13211113202323103 |
5 | 113134114402011 |
6 | 3424011211255 |
7 | 405536252564 |
oct | 74527427323 |
9 | 23014643488 |
10 | 8143122131 |
11 | 34a9642201 |
12 | 16b3146b2b |
13 | 9ca0a4581 |
14 | 5736c216b |
15 | 329d6bddb |
hex | 1e55e2ed3 |
8143122131 has 8 divisors (see below), whose sum is σ = 8259439104. Its totient is φ = 8026850440.
The previous prime is 8143122107. The next prime is 8143122167. The reversal of 8143122131 is 1312213418.
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 8143122131 - 218 = 8142859987 is a prime.
It is a super-2 number, since 2×81431221312 (a number of 21 digits) contains 22 as substring.
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 8143122131.
It is not an unprimeable number, because it can be changed into a prime (8143152131) 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, 541196 + ... + 556038.
It is an arithmetic number, because the mean of its divisors is an integer number (1032429888).
Almost surely, 28143122131 is an apocalyptic number.
8143122131 is a deficient number, since it is larger than the sum of its proper divisors (116316973).
8143122131 is a wasteful number, since it uses less digits than its factorization.
8143122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22641.
The product of its digits is 1152, while the sum is 26.
The square root of 8143122131 is about 90239.2493929332. The cubic root of 8143122131 is about 2011.8564180331.
Adding to 8143122131 its reverse (1312213418), we get a palindrome (9455335549).
The spelling of 8143122131 in words is "eight billion, one hundred forty-three million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •