Base | Representation |
---|---|
bin | 1001010010010011101100… |
… | …1111010011011101100101 |
3 | 1100011002010121000200021201 |
4 | 2110210323033103131211 |
5 | 2314240322032131323 |
6 | 33414245224242501 |
7 | 2102441365442140 |
oct | 224447317233545 |
9 | 40132117020251 |
10 | 10210131130213 |
11 | 3287101933303 |
12 | 118a960310431 |
13 | 590a71387bb1 |
14 | 27425c949057 |
15 | 12a8c7a288ad |
hex | 9493b3d3765 |
10210131130213 has 8 divisors (see below), whose sum is σ = 11669128536320. Its totient is φ = 8751235535280.
The previous prime is 10210131130201. The next prime is 10210131130247. The reversal of 10210131130213 is 31203113101201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10210131130213 - 29 = 10210131129701 is a prime.
It is a super-2 number, since 2×102101311302132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210131110213) 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, 25237773 + ... + 25639138.
It is an arithmetic number, because the mean of its divisors is an integer number (1458641067040).
Almost surely, 210210131130213 is an apocalyptic number.
It is an amenable number.
10210131130213 is a deficient number, since it is larger than the sum of its proper divisors (1458997406107).
10210131130213 is an equidigital number, since it uses as much as digits as its factorization.
10210131130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50905587.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10210131130213 its reverse (31203113101201), we get a palindrome (41413244231414).
The spelling of 10210131130213 in words is "ten trillion, two hundred ten billion, one hundred thirty-one million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •