Base | Representation |
---|---|
bin | 110100010101111001010110… |
… | …001011100011110111110111 |
3 | 1010012002012110001110100012202 |
4 | 310111321112023203313313 |
5 | 220133121423332031403 |
6 | 2133333502350535115 |
7 | 66326424331031300 |
oct | 6425712613436767 |
9 | 1105065401410182 |
10 | 230203103002103 |
11 | 67393651297a50 |
12 | 2199aaa150749b |
13 | 9b5b0a08568ca |
14 | 40bbc6522b7a7 |
15 | 1b9319e92a688 |
hex | d15e562e3df7 |
230203103002103 has 24 divisors (see below), whose sum is σ = 292307248097280. Its totient is φ = 179271175875120.
The previous prime is 230203103001983. The next prime is 230203103002123. The reversal of 230203103002103 is 301200301302032.
It is not a de Polignac number, because 230203103002103 - 226 = 230203035893239 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 (230203103002123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 127514033 + ... + 129306746.
It is an arithmetic number, because the mean of its divisors is an integer number (12179468670720).
Almost surely, 2230203103002103 is an apocalyptic number.
230203103002103 is a deficient number, since it is larger than the sum of its proper divisors (62104145095177).
230203103002103 is a wasteful number, since it uses less digits than its factorization.
230203103002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256822467 (or 256822460 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 230203103002103 its reverse (301200301302032), we get a palindrome (531403404304135).
The spelling of 230203103002103 in words is "two hundred thirty trillion, two hundred three billion, one hundred three million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •