Base | Representation |
---|---|
bin | 110100010110000101… |
… | …1101110011101101111 |
3 | 101202011002001001111202 |
4 | 1220230023232131233 |
5 | 3320204031433403 |
6 | 123350213240115 |
7 | 11056430546141 |
oct | 1505413563557 |
9 | 352132031452 |
10 | 112410421103 |
11 | 43744830172 |
12 | 1995203303b |
13 | a7a59c3c96 |
14 | 5625396c91 |
15 | 2dcda2b688 |
hex | 1a2c2ee76f |
112410421103 has 4 divisors (see below), whose sum is σ = 113441709480. Its totient is φ = 111379132728.
The previous prime is 112410421091. The next prime is 112410421139. The reversal of 112410421103 is 301124014211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301124014211 = 5791 ⋅51998621.
It is a cyclic number.
It is not a de Polignac number, because 112410421103 - 210 = 112410420079 is a prime.
It is a super-2 number, since 2×1124104211032 (a number of 23 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 (112410421153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 515644025 + ... + 515644242.
It is an arithmetic number, because the mean of its divisors is an integer number (28360427370).
Almost surely, 2112410421103 is an apocalyptic number.
112410421103 is a deficient number, since it is larger than the sum of its proper divisors (1031288377).
112410421103 is a wasteful number, since it uses less digits than its factorization.
112410421103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1031288376.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 112410421103 its reverse (301124014211), we get a palindrome (413534435314).
The spelling of 112410421103 in words is "one hundred twelve billion, four hundred ten million, four hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •