Base | Representation |
---|---|
bin | 1001001101101001111100… |
… | …0010001011100111111101 |
3 | 1022212102211010110001011202 |
4 | 2103122133002023213331 |
5 | 2311433122431030323 |
6 | 33313430005025245 |
7 | 2063611553021312 |
oct | 223323702134775 |
9 | 38772733401152 |
10 | 10130201033213 |
11 | 32562154313a8 |
12 | 11773739b5225 |
13 | 586373889701 |
14 | 2704391a8d09 |
15 | 12879a766d28 |
hex | 9369f08b9fd |
10130201033213 has 4 divisors (see below), whose sum is σ = 10168718908128. Its totient is φ = 10091683158300.
The previous prime is 10130201033179. The next prime is 10130201033287. The reversal of 10130201033213 is 31233010203101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10130201033213 - 218 = 10130200771069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130201032213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19258937063 + ... + 19258937588.
It is an arithmetic number, because the mean of its divisors is an integer number (2542179727032).
Almost surely, 210130201033213 is an apocalyptic number.
It is an amenable number.
10130201033213 is a deficient number, since it is larger than the sum of its proper divisors (38517874915).
10130201033213 is an equidigital number, since it uses as much as digits as its factorization.
10130201033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38517874914.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10130201033213 its reverse (31233010203101), we get a palindrome (41363211236314).
The spelling of 10130201033213 in words is "ten trillion, one hundred thirty billion, two hundred one million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •