Base | Representation |
---|---|
bin | 101101001000010110011… |
… | …001000011101011101111 |
3 | 101222111002212020002021011 |
4 | 231020112121003223233 |
5 | 401303022031231101 |
6 | 10332423055250051 |
7 | 440031101340604 |
oct | 55102631035357 |
9 | 11874085202234 |
10 | 3101342055151 |
11 | a962a981376a |
12 | 421089219927 |
13 | 1965bc3b0702 |
14 | aa16a2a46ab |
15 | 55a166c9751 |
hex | 2d216643aef |
3101342055151 has 8 divisors (see below), whose sum is σ = 3158144812800. Its totient is φ = 3044977929240.
The previous prime is 3101342055143. The next prime is 3101342055167. The reversal of 3101342055151 is 1515502431013.
3101342055151 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3101342055151 - 23 = 3101342055143 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 (3101342055101) 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, 109643665 + ... + 109671946.
It is an arithmetic number, because the mean of its divisors is an integer number (394768101600).
Almost surely, 23101342055151 is an apocalyptic number.
3101342055151 is a deficient number, since it is larger than the sum of its proper divisors (56802757649).
3101342055151 is a wasteful number, since it uses less digits than its factorization.
3101342055151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219315869.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 3101342055151 its reverse (1515502431013), we get a palindrome (4616844486164).
The spelling of 3101342055151 in words is "three trillion, one hundred one billion, three hundred forty-two million, fifty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •