Base | Representation |
---|---|
bin | 110100110011101011… |
… | …0100000011101110101 |
3 | 101211201020221112012101 |
4 | 1221213112200131311 |
5 | 3324222143244333 |
6 | 124032514022101 |
7 | 11123143320550 |
oct | 1514726403565 |
9 | 354636845171 |
10 | 113403103093 |
11 | 44104105905 |
12 | 19b8a577931 |
13 | a90356b287 |
14 | 56bb15b697 |
15 | 2e3ac6467d |
hex | 1a675a0775 |
113403103093 has 4 divisors (see below), whose sum is σ = 129603546400. Its totient is φ = 97202659788.
The previous prime is 113403103067. The next prime is 113403103097. The reversal of 113403103093 is 390301304311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 390301304311 = 17389 ⋅22445299.
It is a cyclic number.
It is not a de Polignac number, because 113403103093 - 229 = 112866232181 is a prime.
It is a super-2 number, since 2×1134031030932 (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 (113403103097) 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, 8100221643 + ... + 8100221656.
It is an arithmetic number, because the mean of its divisors is an integer number (32400886600).
Almost surely, 2113403103093 is an apocalyptic number.
It is an amenable number.
113403103093 is a deficient number, since it is larger than the sum of its proper divisors (16200443307).
113403103093 is an equidigital number, since it uses as much as digits as its factorization.
113403103093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16200443306.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 113403103093 in words is "one hundred thirteen billion, four hundred three million, one hundred three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •