Base | Representation |
---|---|
bin | 101101100011001111001… |
… | …110111110101111100101 |
3 | 102002020121221000011011210 |
4 | 231203033032332233211 |
5 | 402241134012032323 |
6 | 10354000000022033 |
7 | 442102411341123 |
oct | 55431716765745 |
9 | 12066557004153 |
10 | 3130213002213 |
11 | aa75746a95a0 |
12 | 4267a6001919 |
13 | 199240891c3b |
14 | ab7087aa913 |
15 | 5665612e293 |
hex | 2d8cf3bebe5 |
3130213002213 has 16 divisors (see below), whose sum is σ = 4562386269696. Its totient is φ = 1893203299440.
The previous prime is 3130213002209. The next prime is 3130213002401. The reversal of 3130213002213 is 3122003120313.
It is not a de Polignac number, because 3130213002213 - 22 = 3130213002209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3130213002213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3130213002113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97370931 + ... + 97403072.
It is an arithmetic number, because the mean of its divisors is an integer number (285149141856).
Almost surely, 23130213002213 is an apocalyptic number.
3130213002213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
3130213002213 is a deficient number, since it is larger than the sum of its proper divisors (1432173267483).
3130213002213 is a wasteful number, since it uses less digits than its factorization.
3130213002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194774504.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 3130213002213 its reverse (3122003120313), we get a palindrome (6252216122526).
The spelling of 3130213002213 in words is "three trillion, one hundred thirty billion, two hundred thirteen million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •