Base | Representation |
---|---|
bin | 101111101001001011… |
… | …0000000011011100111 |
3 | 100210002101101201010210 |
4 | 1133102112000123213 |
5 | 3134014141411403 |
6 | 115000235350503 |
7 | 10251263060265 |
oct | 1372226003347 |
9 | 323071351123 |
10 | 102313232103 |
11 | 3a433174675 |
12 | 179b45b2433 |
13 | 9856b38634 |
14 | 4d48375435 |
15 | 29dc371b03 |
hex | 17d25806e7 |
102313232103 has 4 divisors (see below), whose sum is σ = 136417642808. Its totient is φ = 68208821400.
The previous prime is 102313232083. The next prime is 102313232143. The reversal of 102313232103 is 301232313201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 102313232103 - 29 = 102313231591 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102313232103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102313232143) 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, 17052205348 + ... + 17052205353.
It is an arithmetic number, because the mean of its divisors is an integer number (34104410702).
Almost surely, 2102313232103 is an apocalyptic number.
102313232103 is a deficient number, since it is larger than the sum of its proper divisors (34104410705).
102313232103 is an equidigital number, since it uses as much as digits as its factorization.
102313232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34104410704.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102313232103 its reverse (301232313201), we get a palindrome (403545545304).
The spelling of 102313232103 in words is "one hundred two billion, three hundred thirteen million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •