Base | Representation |
---|---|
bin | 101111101001110000… |
… | …1110110001101110001 |
3 | 100210010202210202212202 |
4 | 1133103201312031301 |
5 | 3134034234110301 |
6 | 115002225432545 |
7 | 10251624052544 |
oct | 1372341661561 |
9 | 323122722782 |
10 | 102333113201 |
11 | 3a443413630 |
12 | 179bb19b755 |
13 | 985aca98b7 |
14 | 4d4ac6c85b |
15 | 29dde9c66b |
hex | 17d3876371 |
102333113201 has 4 divisors (see below), whose sum is σ = 111636123504. Its totient is φ = 93030102900.
The previous prime is 102333113191. The next prime is 102333113279. The reversal of 102333113201 is 102311333201.
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 102333113201 - 230 = 101259371377 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102333112201) 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, 4651505135 + ... + 4651505156.
It is an arithmetic number, because the mean of its divisors is an integer number (27909030876).
Almost surely, 2102333113201 is an apocalyptic number.
102333113201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102333113201 is a deficient number, since it is larger than the sum of its proper divisors (9303010303).
102333113201 is an equidigital number, since it uses as much as digits as its factorization.
102333113201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9303010302.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 102333113201 its reverse (102311333201), we get a palindrome (204644446402).
The spelling of 102333113201 in words is "one hundred two billion, three hundred thirty-three million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •