Base | Representation |
---|---|
bin | 10111011100010101101000… |
… | …100100001000000011001111 |
3 | 111112001111102121111110102210 |
4 | 113130111220210020003033 |
5 | 102003212301211203403 |
6 | 1003140335313521503 |
7 | 30500622453112236 |
oct | 2734255044100317 |
9 | 445044377443383 |
10 | 103102444241103 |
11 | 2a94055699851a |
12 | b691b3bb73293 |
13 | 456b698991298 |
14 | 1b66283623b1d |
15 | bdbde7b12b03 |
hex | 5dc5689080cf |
103102444241103 has 16 divisors (see below), whose sum is σ = 141444065899136. Its totient is φ = 66765555551520.
The previous prime is 103102444241081. The next prime is 103102444241119. The reversal of 103102444241103 is 301142444201301.
It is a happy number.
It is not a de Polignac number, because 103102444241103 - 26 = 103102444241039 is a prime.
It is a super-2 number, since 2×1031024442411032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103102444241143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2207832325 + ... + 2207879022.
It is an arithmetic number, because the mean of its divisors is an integer number (8840254118696).
Almost surely, 2103102444241103 is an apocalyptic number.
103102444241103 is a deficient number, since it is larger than the sum of its proper divisors (38341621658033).
103102444241103 is a wasteful number, since it uses less digits than its factorization.
103102444241103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4415711574.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 103102444241103 its reverse (301142444201301), we get a palindrome (404244888442404).
The spelling of 103102444241103 in words is "one hundred three trillion, one hundred two billion, four hundred forty-four million, two hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •