Base | Representation |
---|---|
bin | 11101111110111001011… |
… | …01001010110101100101 |
3 | 10122111010102001222220221 |
4 | 32333130231022311211 |
5 | 113334322200342013 |
6 | 2105133425324341 |
7 | 134300213422435 |
oct | 16773455126545 |
9 | 3574112058827 |
10 | 1030200012133 |
11 | 3679a6060006 |
12 | 1477aba966b1 |
13 | 761bbc205c6 |
14 | 37c0d2782c5 |
15 | 1bbe7bed08d |
hex | efdcb4ad65 |
1030200012133 has 4 divisors (see below), whose sum is σ = 1030220095840. Its totient is φ = 1030179928428.
The previous prime is 1030200012103. The next prime is 1030200012161. The reversal of 1030200012133 is 3312100020301.
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 a de Polignac number, because none of the positive numbers 2k-1030200012133 is a prime.
It is a super-2 number, since 2×10302000121332 (a number of 25 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 (1030200012103) 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, 9964713 + ... + 10067566.
It is an arithmetic number, because the mean of its divisors is an integer number (257555023960).
Almost surely, 21030200012133 is an apocalyptic number.
It is an amenable number.
1030200012133 is a deficient number, since it is larger than the sum of its proper divisors (20083707).
1030200012133 is an equidigital number, since it uses as much as digits as its factorization.
1030200012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20083706.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1030200012133 its reverse (3312100020301), we get a palindrome (4342300032434).
The spelling of 1030200012133 in words is "one trillion, thirty billion, two hundred million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •