Base | Representation |
---|---|
bin | 1011100011011010… |
… | …0100010110100111 |
3 | 22000010122222212002 |
4 | 2320312210112213 |
5 | 22322413444143 |
6 | 1231423515515 |
7 | 136565502116 |
oct | 27066442647 |
9 | 8003588762 |
10 | 3101312423 |
11 | 1351678a20 |
12 | 726758b9b |
13 | 3a5697511 |
14 | 215c59c7d |
15 | 1324075b8 |
hex | b8da45a7 |
3101312423 has 8 divisors (see below), whose sum is σ = 3421265040. Its totient is φ = 2787695680.
The previous prime is 3101312399. The next prime is 3101312453. The reversal of 3101312423 is 3242131013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3101312423 - 26 = 3101312359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3101312395 and 3101312404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101312453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1582940 + ... + 1584897.
It is an arithmetic number, because the mean of its divisors is an integer number (427658130).
Almost surely, 23101312423 is an apocalyptic number.
3101312423 is a deficient number, since it is larger than the sum of its proper divisors (319952617).
3101312423 is a wasteful number, since it uses less digits than its factorization.
3101312423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167937.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 3101312423 is about 55689.4282876023. The cubic root of 3101312423 is about 1458.3054749276.
Adding to 3101312423 its reverse (3242131013), we get a palindrome (6343443436).
The spelling of 3101312423 in words is "three billion, one hundred one million, three hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •