Base | Representation |
---|---|
bin | 11001000010101000100000… |
… | …110101100000100110010111 |
3 | 112102221112012120100001001202 |
4 | 121002220200311200212113 |
5 | 103413401021142131403 |
6 | 1030121553410343115 |
7 | 32124532106536550 |
oct | 3102504065404627 |
9 | 472845176301052 |
10 | 110132102302103 |
11 | 3210084267aa82 |
12 | 1042840a28aa9b |
13 | 495b54988b91b |
14 | 1d2a5ca6d5327 |
15 | caebc6de5688 |
hex | 642a20d60997 |
110132102302103 has 16 divisors (see below), whose sum is σ = 126601187735040. Its totient is φ = 93847071129696.
The previous prime is 110132102302097. The next prime is 110132102302121. The reversal of 110132102302103 is 301203201231011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110132102302103 - 222 = 110132098107799 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 (110132102202103) 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 15 ways as a sum of consecutive naturals, for example, 15329726 + ... + 21336932.
It is an arithmetic number, because the mean of its divisors is an integer number (7912574233440).
Almost surely, 2110132102302103 is an apocalyptic number.
110132102302103 is a deficient number, since it is larger than the sum of its proper divisors (16469085432937).
110132102302103 is a wasteful number, since it uses less digits than its factorization.
110132102302103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6022526.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 110132102302103 its reverse (301203201231011), we get a palindrome (411335303533114).
The spelling of 110132102302103 in words is "one hundred ten trillion, one hundred thirty-two billion, one hundred two million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •