Base | Representation |
---|---|
bin | 101101011100100111010… |
… | …110000010100001010111 |
3 | 102001120021022002220202010 |
4 | 231130213112002201113 |
5 | 402132102414004421 |
6 | 10350422151515303 |
7 | 441431235103503 |
oct | 55344726024127 |
9 | 12046238086663 |
10 | 3123101313111 |
11 | aa45552aa28a |
12 | 425340388b33 |
13 | 1986793b1b90 |
14 | ab232099303 |
15 | 5638bb02076 |
hex | 2d727582857 |
3123101313111 has 8 divisors (see below), whose sum is σ = 4484453167600. Its totient is φ = 1921908500352.
The previous prime is 3123101313091. The next prime is 3123101313161. The reversal of 3123101313111 is 1113131013213.
3123101313111 is digitally balanced in base 2, 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 not a de Polignac number, because 3123101313111 - 27 = 3123101312983 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 (3123101313161) 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, 40039760386 + ... + 40039760463.
It is an arithmetic number, because the mean of its divisors is an integer number (560556645950).
Almost surely, 23123101313111 is an apocalyptic number.
3123101313111 is a deficient number, since it is larger than the sum of its proper divisors (1361351854489).
3123101313111 is a wasteful number, since it uses less digits than its factorization.
3123101313111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80079520865.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 3123101313111 its reverse (1113131013213), we get a palindrome (4236232326324).
The spelling of 3123101313111 in words is "three trillion, one hundred twenty-three billion, one hundred one million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •