Base | Representation |
---|---|
bin | 110100110100011000… |
… | …1111101000101000001 |
3 | 101211202221001110000100 |
4 | 1221220301331011001 |
5 | 3324244312403033 |
6 | 124035131513013 |
7 | 11123554142622 |
oct | 1515061750501 |
9 | 354687043010 |
10 | 113427075393 |
11 | 44116699625 |
12 | 19b965b8769 |
13 | a908512778 |
14 | 56c03dba49 |
15 | 2e3cdec513 |
hex | 1a68c7d141 |
113427075393 has 6 divisors (see below), whose sum is σ = 163839108914. Its totient is φ = 75618050256.
The previous prime is 113427075343. The next prime is 113427075401. The reversal of 113427075393 is 393570724311.
113427075393 is a `hidden beast` number, since 1 + 1 + 3 + 42 + 70 + 7 + 539 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 82109756304 + 31317319089 = 286548^2 + 176967^2 .
It is a de Polignac number, because none of the positive numbers 2k-113427075393 is a prime.
It is a super-2 number, since 2×1134270753932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113427075343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6301504180 + ... + 6301504197.
Almost surely, 2113427075393 is an apocalyptic number.
It is an amenable number.
113427075393 is a deficient number, since it is larger than the sum of its proper divisors (50412033521).
113427075393 is a wasteful number, since it uses less digits than its factorization.
113427075393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12603008383 (or 12603008380 counting only the distinct ones).
The product of its (nonzero) digits is 476280, while the sum is 45.
The spelling of 113427075393 in words is "one hundred thirteen billion, four hundred twenty-seven million, seventy-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •