Base | Representation |
---|---|
bin | 10111011101110010110000… |
… | …010011111011010110001101 |
3 | 111112102001111221111011022102 |
4 | 113131302300103323112031 |
5 | 102011332040120432000 |
6 | 1003254313130524445 |
7 | 30511062322546544 |
oct | 2735626023732615 |
9 | 445361457434272 |
10 | 103202432202125 |
11 | 2a9799a6550553 |
12 | b6a93a5896725 |
13 | 4577c41b47069 |
14 | 1b6b04ac2d15b |
15 | bde7eac703d5 |
hex | 5ddcb04fb58d |
103202432202125 has 8 divisors (see below), whose sum is σ = 128796635388408. Its totient is φ = 82561945761600.
The previous prime is 103202432202109. The next prime is 103202432202143. The reversal of 103202432202125 is 521202234202301.
It can be written as a sum of positive squares in 4 ways, for example, as 2799106340809 + 100403325861316 = 1673053^2 + 10020146^2 .
It is not a de Polignac number, because 103202432202125 - 24 = 103202432202109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 412809728684 + ... + 412809728933.
It is an arithmetic number, because the mean of its divisors is an integer number (16099579423551).
Almost surely, 2103202432202125 is an apocalyptic number.
It is an amenable number.
103202432202125 is a deficient number, since it is larger than the sum of its proper divisors (25594203186283).
103202432202125 is an frugal number, since it uses more digits than its factorization.
103202432202125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825619457632 (or 825619457622 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 103202432202125 its reverse (521202234202301), we get a palindrome (624404666404426).
The spelling of 103202432202125 in words is "one hundred three trillion, two hundred two billion, four hundred thirty-two million, two hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •