Base | Representation |
---|---|
bin | 110000001101110010… |
… | …1100101110011011111 |
3 | 100220021000122100001000 |
4 | 1200123211211303133 |
5 | 3144023231212421 |
6 | 115322213321343 |
7 | 10323603636606 |
oct | 1403345456337 |
9 | 326230570030 |
10 | 103542054111 |
11 | 3aa03876851 |
12 | 18098036253 |
13 | 99c15b1852 |
14 | 5023648a3d |
15 | 2a601a2226 |
hex | 181b965cdf |
103542054111 has 32 divisors (see below), whose sum is σ = 159507576000. Its totient is φ = 66302337024.
The previous prime is 103542054107. The next prime is 103542054113. The reversal of 103542054111 is 111450245301.
103542054111 is a `hidden beast` number, since 1 + 0 + 3 + 542 + 0 + 5 + 4 + 111 = 666.
It is not a de Polignac number, because 103542054111 - 22 = 103542054107 is a prime.
It is a super-3 number, since 3×1035420541113 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103542054113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 191466 + ... + 493703.
It is an arithmetic number, because the mean of its divisors is an integer number (4984611750).
Almost surely, 2103542054111 is an apocalyptic number.
103542054111 is a deficient number, since it is larger than the sum of its proper divisors (55965521889).
103542054111 is a wasteful number, since it uses less digits than its factorization.
103542054111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685400 (or 685394 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 103542054111 its reverse (111450245301), we get a palindrome (214992299412).
The spelling of 103542054111 in words is "one hundred three billion, five hundred forty-two million, fifty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •