Base | Representation |
---|---|
bin | 1001000001101000011… |
… | …11110101000101011101 |
3 | 1002122110101121010201201 |
4 | 10200310033311011131 |
5 | 20040103214211031 |
6 | 354244155435501 |
7 | 31255630202431 |
oct | 4406417650535 |
9 | 1078411533651 |
10 | 310114210141 |
11 | 10a57842905a |
12 | 50128755b91 |
13 | 23322396838 |
14 | 1101c5149c1 |
15 | 81005cbd61 |
hex | 48343f515d |
310114210141 has 4 divisors (see below), whose sum is σ = 312167946784. Its totient is φ = 308060473500.
The previous prime is 310114210139. The next prime is 310114210181. The reversal of 310114210141 is 141012411013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 310114210141 - 21 = 310114210139 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 (310114210181) 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 3 ways as a sum of consecutive naturals, for example, 1026868095 + ... + 1026868396.
It is an arithmetic number, because the mean of its divisors is an integer number (78041986696).
Almost surely, 2310114210141 is an apocalyptic number.
It is an amenable number.
310114210141 is a deficient number, since it is larger than the sum of its proper divisors (2053736643).
310114210141 is a wasteful number, since it uses less digits than its factorization.
310114210141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2053736642.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 310114210141 its reverse (141012411013), we get a palindrome (451126621154).
The spelling of 310114210141 in words is "three hundred ten billion, one hundred fourteen million, two hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •