Base | Representation |
---|---|
bin | 10111001111101100111011… |
… | …011101011100111011011111 |
3 | 111101222111002111101000121200 |
4 | 113033230323131130323133 |
5 | 101400000421123414403 |
6 | 1001233410555330543 |
7 | 30351112255643541 |
oct | 2717547335347337 |
9 | 441874074330550 |
10 | 102234104123103 |
11 | 2a6362705a3667 |
12 | b5717a2750a53 |
13 | 450783343b384 |
14 | 1b3622acc7691 |
15 | bc4524cdbca3 |
hex | 5cfb3b75cedf |
102234104123103 has 12 divisors (see below), whose sum is σ = 151662604915848. Its totient is φ = 66314013485040.
The previous prime is 102234104123083. The next prime is 102234104123147. The reversal of 102234104123103 is 301321401432201.
102234104123103 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 341 + 0 + 4 + 1 + 2 + 310 + 3 = 666.
It is not a de Polignac number, because 102234104123103 - 228 = 102233835687647 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102234104923103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 153504660513 + ... + 153504661178.
It is an arithmetic number, because the mean of its divisors is an integer number (12638550409654).
Almost surely, 2102234104123103 is an apocalyptic number.
102234104123103 is a deficient number, since it is larger than the sum of its proper divisors (49428500792745).
102234104123103 is a wasteful number, since it uses less digits than its factorization.
102234104123103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307009321734 (or 307009321731 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 102234104123103 its reverse (301321401432201), we get a palindrome (403555505555304).
The spelling of 102234104123103 in words is "one hundred two trillion, two hundred thirty-four billion, one hundred four million, one hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •