Base | Representation |
---|---|
bin | 101111100110101100… |
… | …1011000110011101111 |
3 | 100202212121012212211010 |
4 | 1133031121120303233 |
5 | 3133331414413203 |
6 | 114544112400303 |
7 | 10246234431333 |
oct | 1371531306357 |
9 | 322777185733 |
10 | 102230232303 |
11 | 3a3a03346a1 |
12 | 17990846093 |
13 | 9842897a24 |
14 | 4d3b32b7c3 |
15 | 29d4e29303 |
hex | 17cd658cef |
102230232303 has 8 divisors (see below), whose sum is σ = 136442071600. Its totient is φ = 68085940608.
The previous prime is 102230232289. The next prime is 102230232311. The reversal of 102230232303 is 303232032201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102230232303 - 29 = 102230231791 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 102230232303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102230232373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16883368 + ... + 16889421.
It is an arithmetic number, because the mean of its divisors is an integer number (17055258950).
Almost surely, 2102230232303 is an apocalyptic number.
102230232303 is a deficient number, since it is larger than the sum of its proper divisors (34211839297).
102230232303 is a wasteful number, since it uses less digits than its factorization.
102230232303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33773801.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 102230232303 its reverse (303232032201), we get a palindrome (405462264504).
The spelling of 102230232303 in words is "one hundred two billion, two hundred thirty million, two hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •