Base | Representation |
---|---|
bin | 101111101000111000… |
… | …0001111101100001101 |
3 | 100210001200202210022021 |
4 | 1133101300033230031 |
5 | 3134004123130013 |
6 | 114555243250141 |
7 | 10251112661311 |
oct | 1372160175415 |
9 | 323050683267 |
10 | 102303333133 |
11 | 3a428623401 |
12 | 179b1219951 |
13 | 9854a80a61 |
14 | 4d46d19b41 |
15 | 29db568a8d |
hex | 17d1c0fb0d |
102303333133 has 4 divisors (see below), whose sum is σ = 102357780640. Its totient is φ = 102248885628.
The previous prime is 102303333079. The next prime is 102303333137. The reversal of 102303333133 is 331333303201.
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-102303333133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102303333098 and 102303333107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102303333137) 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, 27220935 + ... + 27224692.
It is an arithmetic number, because the mean of its divisors is an integer number (25589445160).
Almost surely, 2102303333133 is an apocalyptic number.
It is an amenable number.
102303333133 is a deficient number, since it is larger than the sum of its proper divisors (54447507).
102303333133 is an equidigital number, since it uses as much as digits as its factorization.
102303333133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54447506.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 102303333133 its reverse (331333303201), we get a palindrome (433636636334).
The spelling of 102303333133 in words is "one hundred two billion, three hundred three million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •