Base | Representation |
---|---|
bin | 1011101010110000… |
… | …0001001001011101 |
3 | 22002021121020010122 |
4 | 2322230001021131 |
5 | 22403304214323 |
6 | 1234443444325 |
7 | 140421264263 |
oct | 27254011135 |
9 | 8067536118 |
10 | 3132101213 |
11 | 1367a97aaa |
12 | 734b266a5 |
13 | 3abb87537 |
14 | 219d92433 |
15 | 134e89ec8 |
hex | bab0125d |
3132101213 has 8 divisors (see below), whose sum is σ = 3234078720. Its totient is φ = 3030182640.
The previous prime is 3132101149. The next prime is 3132101221. The reversal of 3132101213 is 3121012313.
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 3132101213 - 26 = 3132101149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3132101191 and 3132101200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3132101263) 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, 110243 + ... + 135711.
It is an arithmetic number, because the mean of its divisors is an integer number (404259840).
Almost surely, 23132101213 is an apocalyptic number.
It is an amenable number.
3132101213 is a deficient number, since it is larger than the sum of its proper divisors (101977507).
3132101213 is a wasteful number, since it uses less digits than its factorization.
3132101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29467.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3132101213 is about 55965.1785756107. The cubic root of 3132101213 is about 1463.1154485512.
Adding to 3132101213 its reverse (3121012313), we get a palindrome (6253113526).
Subtracting from 3132101213 its reverse (3121012313), we obtain a square (11088900 = 33302).
The spelling of 3132101213 in words is "three billion, one hundred thirty-two million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •