Base | Representation |
---|---|
bin | 101111100000001001… |
… | …0000010101111111101 |
3 | 100202022021012020112121 |
4 | 1133000102002233331 |
5 | 3132404103000013 |
6 | 114510212402541 |
7 | 10240623264016 |
oct | 1370022025775 |
9 | 322267166477 |
10 | 102010203133 |
11 | 3a298111503 |
12 | 1792b016451 |
13 | 9809119c57 |
14 | 4d1a01400d |
15 | 29c096558d |
hex | 17c0482bfd |
102010203133 has 4 divisors (see below), whose sum is σ = 102013687008. Its totient is φ = 102006719260.
The previous prime is 102010203059. The next prime is 102010203143. The reversal of 102010203133 is 331302010201.
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 102010203133 - 221 = 102008105981 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 (102010203143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1697641 + ... + 1756702.
It is an arithmetic number, because the mean of its divisors is an integer number (25503421752).
Almost surely, 2102010203133 is an apocalyptic number.
It is an amenable number.
102010203133 is a deficient number, since it is larger than the sum of its proper divisors (3483875).
102010203133 is an equidigital number, since it uses as much as digits as its factorization.
102010203133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3483874.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 102010203133 its reverse (331302010201), we get a palindrome (433312213334).
The spelling of 102010203133 in words is "one hundred two billion, ten million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •