Base | Representation |
---|---|
bin | 10111001100010011000101… |
… | …111000101000010101000101 |
3 | 111101011010100112201012110101 |
4 | 113030103011320220111011 |
5 | 101332132404021132323 |
6 | 1000534125125124101 |
7 | 30325162060530166 |
oct | 2714230570502505 |
9 | 441133315635411 |
10 | 102000203302213 |
11 | 2a556052695a17 |
12 | b5343a5859631 |
13 | 44bb76884c688 |
14 | 1b28b9c6a376d |
15 | bbd3d5559dad |
hex | 5cc4c5e28545 |
102000203302213 has 4 divisors (see below), whose sum is σ = 102000418208640. Its totient is φ = 101999988395788.
The previous prime is 102000203302189. The next prime is 102000203302219. The reversal of 102000203302213 is 312203302000201.
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 102000203302213 - 29 = 102000203301701 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 (102000203302219) 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, 106739695 + ... + 107691052.
It is an arithmetic number, because the mean of its divisors is an integer number (25500104552160).
Almost surely, 2102000203302213 is an apocalyptic number.
It is an amenable number.
102000203302213 is a deficient number, since it is larger than the sum of its proper divisors (214906427).
102000203302213 is an equidigital number, since it uses as much as digits as its factorization.
102000203302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214906426.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102000203302213 its reverse (312203302000201), we get a palindrome (414203505302414).
The spelling of 102000203302213 in words is "one hundred two trillion, two hundred three million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •