Base | Representation |
---|---|
bin | 101101001010000111000… |
… | …010101011001110011101 |
3 | 101222122222120111220022220 |
4 | 231022013002223032131 |
5 | 401320404343410323 |
6 | 10333334411455553 |
7 | 440125660614453 |
oct | 55120702531635 |
9 | 11878876456286 |
10 | 3103232013213 |
11 | a97089630182 |
12 | 4215161575b9 |
13 | 196830b095a7 |
14 | aa2a92b69d3 |
15 | 55ac75a20e3 |
hex | 2d2870ab39d |
3103232013213 has 8 divisors (see below), whose sum is σ = 4167409898400. Its totient is φ = 2053937735088.
The previous prime is 3103232013197. The next prime is 3103232013227. The reversal of 3103232013213 is 3123102323013.
3103232013213 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 3103232013213 - 24 = 3103232013197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3103232013913) 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, 3720901278 + ... + 3720902111.
It is an arithmetic number, because the mean of its divisors is an integer number (520926237300).
Almost surely, 23103232013213 is an apocalyptic number.
It is an amenable number.
3103232013213 is a deficient number, since it is larger than the sum of its proper divisors (1064177885187).
3103232013213 is a wasteful number, since it uses less digits than its factorization.
3103232013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7441803531.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 3103232013213 its reverse (3123102323013), we get a palindrome (6226334336226).
The spelling of 3103232013213 in words is "three trillion, one hundred three billion, two hundred thirty-two million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •